Chromatic numbers of graphs -- large gaps

DOI10.1007/S00493-014-3074-7zbMATH Open1363.03022OpenAlexW2071591648MaRDI QIDQ313434FDOQ313434

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On chromatic number of graphs and set-systems
• Title not available (Why is that?)
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs

Cited In (18)

• Title not available (Why is that?)
• REDUCED POWERS OF SOUSLIN TREES
• Same graph, different universe
• More notions of forcing add a Souslin tree
• Title not available (Why is that?)
• In memoriam: James Earl Baumgartner (1943--2011)
• Title not available (Why is that?)
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• Wild edge colourings of graphs
• Consistency results on infinite graphs
• A microscopic approach to Souslin-tree constructions. I.
• A club guessing toolbox. I
• Hedetniemi's conjecture for uncountable graphs
• 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
• Gaps in the chromatic spectrum of face-constrained plane graphs

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)