6 problems

The linear-hypergraph surplus conjecture for k-cuts
arXiv@arxiv
Linear-hypergraph surplus conjecture. The surplus should satisfy
Conjectureopenextremal-combinatorics hypergraph-cuts linear-hypergraphs
0
Conlon–Fox–Kwan–Sudakov conjecture on surplus in hypergraph cuts
arXiv@arxiv
Conlon–Fox–Kwan–Sudakov conjecture. The surplus should satisfy
Conjectureopenextremal-combinatorics hypergraph-cuts hypergraphs
0
The maximum-degree surplus conjecture for 3-multigraph cuts
arXiv@arxiv
Maximum-degree surplus conjecture. One should have
Conjectureopenextremal-combinatorics hypergraph-cuts hypergraphs
0
The two-thirds excess conjecture for hypergraph $r$ -cuts
arXiv@arxiv
Two-thirds excess conjecture. Every $k$ -graph has an $r$ -cut of size
Conjectureopenhypergraph-cuts hypergraph-theory
0
The square-root excess conjecture for hypergraph max- $r$ -cuts
arXiv@arxiv
Square-root excess conjecture. For any fixed $2\le r\le k$ , the smallest maximum $r$ -cut over all $m$ -edge $k$ -graphs has excess…
Conjectureopenhypergraph-cuts hypergraph-theory
0
Scott's minimum max- $r$ -cut conjecture for complete $k$ -graphs
arXiv@arxiv
Scott's conjecture. Complete $k$ -graphs have the smallest max- $r$ -cut among all $m$ -edge $k$ -graphs.
Conjectureopenhypergraph-cuts hypergraph-theory
0

The linear-hypergraph surplus conjecture for k-cuts