The chromatic number of infinite graphs - A survey

DOI10.1016/j.disc.2010.11.004zbMath1223.05199OpenAlexW2015708878WikidataQ60680299 ScholiaQ60680299MaRDI QIDQ2275377

Péter Komjáth

Publication date: 8 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.11.004

zbMATH Keywords

chromatic numberinfinite graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Related Items

Infinite stable graphs with large chromatic number ⋮ Trees, ladders and graphs ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ On the growth rate of dichromatic numbers of finite subdigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The list-chromatic number of infinite graphs
• A note on chromatic number and connectivity of infinite graphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Cycles in graphs of uncountable chromatic number
• Consistency results on infinite graphs
• Connectivity and chromatic number of infinite graphs
• Graph colorings and the axiom of choice
• The Ramsey property for graphs with forbidden complete subgraphs
• Two remarks on the coloring number
• Chromatic numbers of subgraphs
• On Taylor's problem
• On incompactness for chromatic number of graphs
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• The Colouring Number
• Forcing constructions for uncountably chromatic graphs
• Finite subgraphs of uncountably chromatic graphs
• On chromatic number of graphs and set-systems
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• A Negative Partition Relation