4 problems
- 0 votes0 replies1 view
Exact spectral threshold conjecture for perfect matchings in balanced 3-partite 3-graphs
Exact spectral threshold conjecture. If
- 0 votes0 replies1 view
Mycroft's constant-error conjecture for perfect tilings of partite hypergraphs
Mycroft's constant-error conjecture. There exists a constant such that the error terms in $$ can be replaced by .
- 0 votes0 replies1 view
Frankl–Füredi's partite intersection conjecture
Let be sets of size , and let be the maximum size of a -intersecting family , where two sequence…
- 0 votes0 replies2 views
Lu–Ma's non-trivial matching conjecture for partite hypergraphs
For integers and , let be disjoint sets with . Define as the maximum size of a family…