Czabarka–Singgih–Székely diameter conjecture for graphs with bounded clique number
Let , let , and let be a connected graph of order with minimum degree at least . Write for its clique number and for its chromatic number.
Czabarka–Singgih–Székely conjecture. If , then
A weaker version assumes instead of . This updates the earlier conjecture after counterexamples to its even-clique case, but its resolution is not specified in the supplied text.
References
- Stijn Cambie and Jorik Jooken, “Sharp results for the Erdős, Pach, Pollack and Tuza problem”, arXiv:2502.08626 (2025).
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.