Abstract
Let G and H be two graphs. We say that G induces H if G has an induced subgraph isomorphic to H: A. Gyárfás and D. Sumner, independently, conjectured that, for every tree T. there exists a function f T ; called binding function, depending only on T with the property that every graph G with chromatic number f T (ω(G)) induces T. A. Gyárfás, E. Szemerédi and Z. Tuza confirmed the conjecture for all trees of radius two on triangle-free graphs, and H. Kierstead and S. Penrice generalized the approach and the conclusion of A. Gyárfás et al. onto general graphs. A. Scott proved an interesting topological version of this conjecture asserting that for every integer k and every tree T of radius r, every graph G with ω(G) ⩽ k and sufficient large chromatic number induces a subdivision of T of which each edge is subdivided at most O(14r-1(r - 1)!) times. We extend the approach of A. Gyárfás and present a binding function for trees obtained by identifying one end of a path and the center of a star. We also improve A. Scott's upper bound by modifying his subtree structure and partition technique, and show that for every integer k and every tree T of radius r, every graph with ω(G) ⩽ k and sufficient large chromatic number induces a subdivision of T of which each edge is subdivided at most O(6r−2) times.
Similar content being viewed by others
References
Beineke L. Derived graphs and digraphs. In: Sachs H, ed. Beiträge zur Graphentheorie. Leipzig: Teubner, 1968, 17–33
Bondy J, Murty U. Graph Theory. Berlin: Springer, 2008
Chudnovsky M, Penev I, Scott A, Trotignon N. Substitution and -boundedness. J Combin Theory Ser B, 2013, 103: 567–586
Chudnovsky M, Robertson N, Seymour P, Thomas R. The strong perfect graph theorem. Ann of Math, 2006, 164: 51–229
Descartes B. A three colour problem. Eureka, 1947, 21
Erdös P. Graph theory and probability. Canad J Math, 1959, 11: 34–38
Gyárfás A. On Ramsey covering-numbers. In: Infinite and Finite Sets. Colloquia Mathematic Societatis János Bolyai 10. New York: North-Holland/American Elsevier, 1975, 801–816
Gyárfás A. Problems from the world surrounding perfect graphs. Zastosow Mat, 1987, 19: 413–441
Gyárfás A, Szemerédi E, Tuza Z. Induced subtrees in graphs of large chromatic number. Discrete Math, 1980, 30: 235–244
Kierstead H, Penrice S. Radius two trees specify (G)-bounded classes. J Graph Theory, 1994, 18: 119–129
Kierstead H, Zhu Y. Radius three trees in graphs with large chromatic number. SIAM J Discrete Math, 2004, 17: 571–581
Mycielski J. Sur le coloriage des graphes. Colloq Math, 1955, 3: 161–162
Scott A. Induced trees in graphs of large chromatic number. J Graph Theory, 1997, 24: 297–311
Sumner D. Subtrees of a graph and chromatic number. In: The Theory and Applications of Graphs. New York: John Wiley & Sons, 1981: 557–576
Vizing V. The chromatic class of a multigraph. Kibernetika (Kiev), 1965, 3: 29–39
Zykov A. On some properties of linear complexes. Mat Sb, 1949, 24: 313–319 (in Russian)
Acknowledgements
The authors thank the referees for their valuable comments. This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 11331003, 11571180) and a Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xu, B., Zhang, Y. Chromatic number and subtrees of graphs. Front. Math. China 12, 441–457 (2017). https://doi.org/10.1007/s11464-016-0613-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11464-016-0613-0