1 problem

Matching

The characterization conjecture for $F$ -factors in $k$ -uniform hypergraphs
The characterization conjecture. The $k$ -graph $F$ belongs to $\textbf{FACTOR}_k$ if and only if it satisfies:
openextremal-combinatorics hypergraph-factors quasi-random-hypergraphs
08