The clique-number conjecture for graphs with chromatic number near the order
Let denote the minimum clique number among graphs on vertices with chromatic number . The clique-number conjecture. Let be a positive integer. If is sufficiently large, then
References
Status
- Refuted: Csaba Biró, Zoltán Füredi, and Sogol Jahanbekam. Large Chromatic Number and Ramsey Graphs (Graphs and Combinatorics, 2013) https://link.springer.com/article/10.1007/s00373-012-1179-6
Source: Csaba Biró, “Large cliques in graphs with high chromatic number”, arXiv:1107.2630 (2011).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.