3 problems

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
0 votes0 replies0 views
Coincidence of subgraph and factor thresholds in pseudo-random hypergraphs
Let $F$ be a linear $k$ -graph. Consider the threshold for the appearance of a single copy of $F$ in a pseudo-random $k$ -graph and the threshold for the appearance of an $F$ -factor,…
Conjectureopenhypergraph-factors pseudo-random-hypergraphsarXiv posted 2 days ago
0 votes0 replies0 views
Minimum codegree conjecture for loose cycle factors
Loose-cycle factor conjecture. If $n$ is sufficiently large and
Conjectureopenhypergraph-factors loose-cycles minimum-codegreearXiv posted 2 days ago

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