6 problems
- 0 votes0 replies0 views
Alon's non-star-forest bound for intersecting graph families
Alon's non-star-forest conjecture. There is a universal constant such that, whenever is not a star forest, the largest -intersecting family on vertices has size at…
- 0 votes0 replies0 views
Christofides counterexample to the -umvirate conjecture
-umvirate conjecture. The largest -intersecting family is a -umvirate. This conjecture is false: Christofides constructed a -intersecting family on vertices…
- 0 votes0 replies1 view
Keller–Lifschitz counterexample to the biased extension
Biased extension conjecture. These biased results should extend to . This conjecture was disproved by Keller and Lifschitz, so the proposed extension is false.
- 0 votes0 replies0 views
Cross--chromatic-agreeing conjecture
Cross--chromatic-agreeing conjecture. The cross--chromatic-agreeing analogue of the source's theorem should hold for all , with upper bound
- 0 votes0 replies1 view
Cross--intersecting theorem for all large cliques
Cross--intersecting conjecture. The same theorem, including its upper bound, uniqueness, and stability conclusions, should hold for all . The source proves the cases…
- 0 votes0 replies0 views
The cycle-chain prime-labeling conjecture
A cycle chain is the graph family constructed in the paper by joining cycles in a chain. A graph is prime if it has a vertex labeling by consecutive integers starting at such t…