1 problem

0 votes0 replies1 view
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:
Conjectureopenextremal-combinatorics hypergraph-factors quasi-random-hypergraphsarXiv posted 2 days ago

The characterization conjecture for FFF-factors in kkk-uniform hypergraphs