On the growth rate of chromatic numbers of finite subgraphs

DOI10.1016/j.aim.2020.107176zbMath1440.05090arXiv1902.08177OpenAlexW3021340768MaRDI QIDQ2182268

Chris Lambie-Hanson

Publication date: 23 May 2020

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.08177

zbMATH Keywords

club guessingchromatic numberuncountable graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items

On the growth rate of dichromatic numbers of finite subdigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forcing constructions for uncountably chromatic graphs
• On circuits and subgraphs of chromatic graphs
• Finite subgraphs of uncountably chromatic graphs
• Set Theory
• On generalized shift graphs
• On chromatic number of graphs and set-systems