Packing Trees Into n-Chromatic Graphs

• Autorzy: András Gyárfás
• Języki publikacji: EN

Abstrakty

EN

We show that if a sequence of trees T1, T2, ..., Tn−1 can be packed into Kn then they can be also packed into any n-chromatic graph.

Słowa kluczowe

EN

tree packing

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2014
• Tom: 34
• Numer: 1
• Strony: 199-201

Daty

wydano

2014-02-01

online

2014-02-14

Twórcy

autor

András Gyárfás

• Alfréd Rényi Institute of Mathematics

Bibliografia

• [1] D. Gerbner, B. Keszegh and C. Palmer, Generalizations of the tree packing conjecture, Discuss. Math. Graph Theory 32 (2012) 569-582. doi:10.7151/dmgt.1628[Crossref]
• [2] D. Gerbner, B. Keszegh and C. Palmer, Red-blue alternating paths, Third Emléktábla Workshop, p.25. http://www.renyi.hu/emlektab/index/booklet.html
• [3] A. Gyárfás and J. Lehel, Packing trees of different order into Kn, Combinatorics, Proc. Fifth Hungarian Coll. Keszthely, 1976, Vol II. North Holland. Colloq. Math. Soc. J. Bolyai 18 463-469.
• [4] A. Gyárfás, E. Szemerédi and Zs. Tuza, Induced subtrees in graphs of large chromatic number , Discrete Math. 30 (1980) 235-244. doi:10.1016/0012-365X(80)90230-7[Crossref]
• [5] S. Zaks and C.L. Liu, Decomposition of graphs into trees, Proceedings of 8-th South- eastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, La. Util. Math., Congr. Numer. XIX (1977) 643-654.

Identyfikatory

DOI

10.7151/dmgt.1735