Abstract
Let \({\mu \geq \omega}\) be regular, assume the Generalized Continuum Hypothesis and the principle \({\square_\lambda}\) holds for every singular \({\lambda}\) with \({{\rm cf}(\lambda) \leq \mu}\). Let X be a graph with chromatic number greater than \({\mu^+}\). Then X contains a \({\mu}\)-connected subgraph Y of X whose chromatic number is greater than \({\mu^+}\).
Similar content being viewed by others
References
Komjáth P.: Connectivity and chromatic number of infinite graphs. Israel J. Math., 56, 257–266 (1986)
Komjáth P.: The colouring number. J. London Math. Soc., 54, 1–14 (1987)
Komjáth P.: Consistency results on infinite graphs. Israel J. Math., 61, 285–294 (1988)
P. Komjáth, A note on chromatic number and connectivity of infinite graphs, Israel J. Math., to appear.
Shelah S.: A compactness theorem in singular cardinals, free algebras, Whitehead problem, and transversals. Israel J. Math., 21, 319–349 (1975)
Dániel T. Soukup: Trees, ladders, and graphs, J. Combin. Theory, Ser. B, 115 (2015), 96–116.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Komjáth, P. On the connectivity of infinite graphs. Acta Math. Hungar. 154, 215–222 (2018). https://doi.org/10.1007/s10474-017-0752-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-017-0752-0