Abstract
We study two parameters obtained from the Euler characteristic by replacing the number of faces with that of induced and induced non-separating cycles. By establishing monotonicity of such parameters under certain homomorphism and edge contraction, we obtain new upper bounds on the chromatic number in terms of the number of induced cycles and the Hadwiger number in terms of the number of induced non-separating cycles. As an application, we show that every 3-connected graph with average degree at least 2k for some \(k\ge 2\) have at least \((k-1)|V|+Ck^{3}\log ^{3/2}k\) induced non-separating cycles for some explicit constant \(C>0\). This improves the previous best known lower bound \((k-1)|V|+1\), which follows from Tutte’s cycle space theorem. We also give a short proof of this theorem of Tutte.
Similar content being viewed by others
References
Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2000)
Kostochka, A.V.: Lower bound of the hadwiger number of graphs by their average degree. Combinatorica 4(4), 307–316 (1984)
Kriesell, M.: Contractible non-edges in 3-connected graphs. J. Combin. Theory Ser. B 74(2), 192–201 (1998)
Seymour, P.: Decomposition of Regular Matroids. A Source Book in Matroid Theory, p. 339 (1986)
Thomassen, C.: Planarity and duality of finite and infinite graphs. J. Combin. Theory Ser. B 29(2), 244–271 (1980)
Tutte, W.T.: A theory of 3-connected graphs. Indag. Math. 23, 441–455 (1961)
Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13(3), 743–768 (1963)
Vince, A., Little, C.H.: Discrete jordan curve theorems. J. Combin. Theory Ser. B 47(3), 251–261 (1989)
Yu, X.: Non-separating cycles and discrete Jordan curves. J. Combin. Theory Ser. B 54(1), 142–154 (1992)
Acknowledgements
The author is grateful for the anonymous referees for their valuable suggestions, which helped improving the presentation significantly. The author also thanks to Neil Robertson and Paul Seymour for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lyu, H. Chromatic Number, Induced Cycles, and Non-separating Cycles. Graphs and Combinatorics 36, 1297–1310 (2020). https://doi.org/10.1007/s00373-020-02187-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02187-4