Connectivity and chromatic number of infinite graphs

DOI10.1007/BF02782936zbMath0673.05035OpenAlexW1987592722MaRDI QIDQ1120588

Péter Komjáth

Publication date: 1986

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02782936

zbMATH Keywords

infinite graphsuncountable chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (7)

Consistency results on infinite graphs ⋮ A note on chromatic number and connectivity of infinite graphs ⋮ On the connectivity of infinite graphs ⋮ Trees, ladders and graphs ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ The chromatic number of infinite graphs - A survey ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE

Cites Work

• Unnamed Item
• In singular cardinality, locally free algebras are free
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• On Shelah's compactness of cardinals
• Two remarks on the coloring number
• On chromatic number of graphs and set-systems

This page was built for publication: Connectivity and chromatic number of infinite graphs