The Colouring Number

DOI10.1112/PLMS/S3-54.1.1zbMath0579.03035OpenAlexW1990271562MaRDI QIDQ3701415

Péter Komjáth

Publication date: 1987

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-54.1.1

zbMATH Keywords

forcingchromatic numberinfinite graphssupercompact cardinalstationary setsbox-principles

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items (8)

Two remarks on the coloring number ⋮ On Taylor's problem ⋮ The list-chromatic number of infinite graphs ⋮ On the connectivity of infinite graphs ⋮ The chromatic number of infinite graphs - A survey ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ Embedding Graphs into Colored Graphs ⋮ Putting a diamond inside the square

This page was built for publication: The Colouring Number