Two remarks on the coloring number

DOI10.1006/jctb.1997.1760zbMath0876.05034OpenAlexW2060638172MaRDI QIDQ1362106

Péter Komjáth

Publication date: 12 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1760

zbMATH Keywords

chromatic numbercoloring numberwell-ordering

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Connectivity and chromatic number of infinite graphs ⋮ The chromatic number of infinite graphs - A survey

Cites Work

• Unnamed Item
• Unnamed Item
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• On a conjecture of Rödl and Voigt
• On incompactness for chromatic number of graphs
• The Colouring Number
• On Representatives of Subsets
• On chromatic number of graphs and set-systems
• Distinct representatives of subsets

This page was built for publication: Two remarks on the coloring number