Chromatic numbers of graphs -- large gaps

DOI10.1007/S00493-014-3074-7MaRDI QIDQ313434zbMATH OpenOpenAlexFDO

Authors Assaf Rinot

Publication date 9 September 2016

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-014-3074-7

zbMATH Keywords

gapchromatic numbercofinal subsetCohen subsetinfinite cardinalJensen's axiomsingular cardinaluncountable cardinal

Mathematics Subject Classification ID

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

Recommendations

• Consistency results on infinite graphs
• scientific article; zbMATH DE number 4200229
• scientific article; zbMATH DE number 426350
• What must and what need not be contained in a graph of uncountable chromatic number?
• The Colouring Number

Cites work

• scientific article; zbMATH DE number 1163988 (Why is no real title available?)
• scientific article; zbMATH DE number 1795298 (Why is no real title available?)
• scientific article; zbMATH DE number 3262991 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Chromatic numbers of subgraphs
• Combinatorial Dichotomies in Set Theory
• Consistency results on infinite graphs
• Generic graph construction
• Jensen's diamond principle and its relatives
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• On chromatic number of graphs and set-systems
• On incompactness for chromatic number of graphs
• Some downwards transfer properties for \(\aleph _ 2\)
• The Ostaszewski square and homogeneous Souslin trees
• The covering lemma

Cited in

(18)

• Gaps in the chromatic spectrum of face-constrained plane graphs
• scientific article; zbMATH DE number 426350 (Why is no real title available?)
• REDUCED POWERS OF SOUSLIN TREES
• Same graph, different universe
• More notions of forcing add a Souslin tree
• scientific article; zbMATH DE number 1795298 (Why is no real title available?)
• In memoriam: James Earl Baumgartner (1943--2011)
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• scientific article; zbMATH DE number 3788655 (Why is no real title available?)
• Consistency results on infinite graphs
• Wild edge colourings of graphs
• A microscopic approach to Souslin-tree constructions. I.
• Hedetniemi's conjecture for uncountable graphs
• A club guessing toolbox. I
• A microscopic approach to Souslin-tree construction. II
• A note on uncountable chordal graphs
• On incompactness for chromatic number of graphs
• A note on the Engelking-Karłowicz theorem

This page was built for publication: Chromatic numbers of graphs -- large gaps

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