The Colouring Number

DOI10.1112/PLMS/S3-54.1.1MaRDI QIDQ3701415zbMATH OpenOpenAlexFDO

Authors 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

box-principleschromatic numberforcinginfinite graphsstationary setssupercompact cardinal

Mathematics Subject Classification ID

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

Recommendations

• Coloring numbers
• scientific article; zbMATH DE number 4008415
• A Coloring Problem
• Total colouring
• The distinguishing chromatic number
• scientific article; zbMATH DE number 6381708
• scientific article; zbMATH DE number 932605

Cited in

(27)

• A graph which embeds all small graphs on any large set of vertices
• Two remarks on the coloring number
• On the connectivity of infinite graphs
• Bipartite graphs and monochromatic squares
• On Taylor's problem
• Ramsey theory for highly connected monochromatic subgraphs
• Multicolor Turán numbers
• The chromatic number of infinite graphs - A survey
• The colouring number of infinite graphs
• A note on the Engelking-Karłowicz theorem
• Lower bounds on coloring numbers from hardness hypotheses in pcf theory
• scientific article; zbMATH DE number 6381708 (Why is no real title available?)
• Chromatic numbers of graphs -- large gaps
• scientific article; zbMATH DE number 4200229 (Why is no real title available?)
• The list-chromatic number of infinite graphs
• Embedding Graphs into Colored Graphs
• Colorful Partitions of Cardinal Numbers
• scientific article; zbMATH DE number 15458 (Why is no real title available?)
• Infinite combinatorics plain and simple
• scientific article; zbMATH DE number 4118372 (Why is no real title available?)
• Putting a diamond inside the square
• Wild edge colourings of graphs
• Identities on cardinals less than ℵ_ω
• A note on edge colorings and trees
• The Erdős-Hajnal problem list
• Davies's theorem and the coloring number of graphs
• Monocolored topological complete graphs in colorings of uncountable complete graphs

This page was built for publication: The Colouring Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701415)