The Colouring Number

DOI10.1112/PLMS/S3-54.1.1zbMATH Open0579.03035OpenAlexW1990271562MaRDI QIDQ3701415FDOQ3701415

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

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

zbMATH Keywords

chromatic numberforcinginfinite graphssupercompact cardinalstationary setsbox-principles

Mathematics Subject Classification ID

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

Cited In (22)

• Monocolored topological complete graphs in colorings of uncountable complete graphs
• A graph which embeds all small graphs on any large set of vertices
• Bipartite graphs and monochromatic squares
• Title not available (Why is that?)
• The chromatic number of infinite graphs - A survey
• Multicolor Turán numbers
• Colorful Partitions of Cardinal Numbers
• Two remarks on the coloring number
• On the connectivity of infinite graphs
• Chromatic numbers of graphs -- large gaps
• A note on edge colorings and trees
• Title not available (Why is that?)
• Infinite combinatorics plain and simple
• Wild edge colourings of graphs
• Title not available (Why is that?)
• Embedding Graphs into Colored Graphs
• Putting a diamond inside the square
• Ramsey theory for highly connected monochromatic subgraphs
• The colouring number of infinite graphs
• The list-chromatic number of infinite graphs
• A note on the Engelking-Karłowicz theorem
• On Taylor's problem

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)