Dong's vertex-isolation conjecture for mean color numbers
Let be a graph and let be a vertex of . Write for the graph obtained by deleting , and let be the one-vertex graph. Dong's vertex-isolation conjecture. One has
This conjecture concerns whether isolating a vertex cannot increase the mean color number. Dong proved the related Bartels–Welsh lower-bound conjecture, but the supplied text gives no resolution status for this assertion.
References
- Wushuang Zhai and Yan Yang, “Counterexamples to two conjectures on mean color numbers of graphs”, arXiv:2405.01890 (2024).
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.