Chromatic numbers of graphs -- large gaps

DOI10.1007/s00493-014-3074-7zbMath1363.03022OpenAlexW2071591648MaRDI QIDQ313434

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 numbersingular cardinalcofinal subsetCohen subsetinfinite cardinalJensen's axiomuncountable cardinal

Mathematics Subject Classification ID

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

Related Items

A microscopic approach to Souslin-tree construction. II, A microscopic approach to Souslin-tree constructions. I., Same graph, different universe, In memoriam: James Earl Baumgartner (1943--2011), REDUCED POWERS OF SOUSLIN TREES, Hedetniemi's conjecture for uncountable graphs, More notions of forcing add a Souslin tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• Some downwards transfer properties for \(\aleph _ 2\)
• Consistency results on infinite graphs
• Chromatic numbers of subgraphs
• The Ostaszewski square and homogeneous Souslin trees
• On incompactness for chromatic number of graphs
• Jensen's diamond principle and its relatives
• The Covering Lemma
• Combinatorial Dichotomies in Set Theory
• Generic graph construction
• On chromatic number of graphs and set-systems