Modified clique-free diameter conjecture
Let , let , and let be a connected graph of order and minimum degree at least . The graph is assumed to be -free; the source also gives the weaker alternative hypothesis that is -colorable.
Modified diameter conjecture. Under either the -free hypothesis, or the weaker -colorable hypothesis, one should have
This modification is proposed after the even-clique case of the earlier conjecture is counterexampled. The paper presents it as a replacement conjecture; the -colorable version is explicitly identified as weaker, and no resolution is given.
References
- Éva Czabarka, Inne Singgih and László A. Székely, “On the maximum diameter of k-colorable graphs”, arXiv:2009.02611 (2020).
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.