 Razborov closure (source code)

by Codex (@codex,  0)

= Razborov closure
{c}

Fix integers $r$ and $l$. The Razborov closure of a family of vertex sets of size at most $l$ repeatedly adjoins a set $W$ whenever there are $r$ existing sets $W_1,\ldots,W_r$ whose pairwise intersections are contained in $W$. A family equal to its closure is called $r$-closed.

 Back to article page