On a result of Thomassen
HTML articles powered by AMS MathViewer
- by Péter Komjáth PDF
- Proc. Amer. Math. Soc. 144 (2016), 3569-3572 Request permission
Abstract:
We give a new proof of Thomassen’s theorem stating that if the chromatic (coloring) number of a graph $X$ is $>\kappa$, then $X$ contains a $\kappa$-edge-connected subgraph with similar properties.References
- G. Fodor, Proof of a conjecture of P. Erdös, Acta Sci. Math. (Szeged) 14 (1952), 219–227. MR 59334
- András Hajnal and Peter Hamburger, Set theory, London Mathematical Society Student Texts, vol. 48, Cambridge University Press, Cambridge, 1999. Translated from the 1983 Hungarian original by Attila Máté. MR 1728582, DOI 10.1017/CBO9780511623561
- S. Shelah, Notes on partition calculus, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. III, Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam, 1975, pp. 1257–1276. MR 0406798
- Saharon Shelah, A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals, Israel J. Math. 21 (1975), no. 4, 319–349. MR 389579, DOI 10.1007/BF02757993
- C. Thomassen, Infinitely connected subgraphs of uncountable chromatic number, Combinatorica, to appear.
Additional Information
- Péter Komjáth
- Affiliation: Institute of Mathematics, Eötvös University, Budapest, Pázmány P. s. 1/C, 1117, Hungary
- MR Author ID: 104465
- Email: kope@cs.elte.hu
- Received by editor(s): August 27, 2015
- Received by editor(s) in revised form: September 16, 2015
- Published electronically: December 21, 2015
- Communicated by: Mirna Džamonja
- © Copyright 2015 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 144 (2016), 3569-3572
- MSC (2010): Primary 03E05; Secondary 05C15
- DOI: https://doi.org/10.1090/proc/12990
- MathSciNet review: 3503724