Square-coloring codegree conjecture
Let be a graph. Its square is obtained by joining distinct vertices that are connected by a two-edge path in . Let be the maximum degree, the maximum codegree, and the chromatic number of the square. Square-coloring conjecture. There is a constant such that
This is an analogue of Vu's conjecture for coloring graph squares and is proposed as an open problem.
References
- Linda Cook, Ross J. Kang, Eileen Robinson and Gabriëlle Zwaneveld, “Vu's conjecture holds for claw-free graphs”, arXiv:2510.15553 (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.