Caro, Lauri, and Zarb's forest bound conjecture for
Let be a positive integer and let be a forest. For a graph , let be the minimum cardinality of a set of vertices of such that has either vertices of maximum degree or order less than .
Caro, Lauri, and Zarb's conjecture. If has order at most
then
This is a precise conjecture for forests that improves the known general forest bound and was constructed to be tight by matching examples. The paper states that it verifies this conjecture.
References
- M. Fürst, M. Gentner, M. A. Henning, S. Jäger and D. Rautenbach, “Equating k Maximum Degrees in Graphs without Short Cycles”, arXiv:1705.07409 (2017).
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.