Infinite stable graphs with large chromatic number

DOI10.1090/tran/8570OpenAlexW4206344846MaRDI QIDQ5036100

Saharon Shelah, Yatir Halevi, Itay Kaplan

Publication date: 23 February 2022

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

stable graphschromatic numberTaylor's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Classification theory, stability, and related concepts in model theory (03C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What must and what need not be contained in a graph of uncountable chromatic number?
• Cycles in graphs of uncountable chromatic number
• Classification theory and the number of non-isomorphic models
• The chromatic number of infinite graphs - A survey
• Modèles saturés et modèles engendrés par des indiscernables
• Stable theories and representation over sets
• STATIONARY TYPES IN MODULESS
• Stable graphs
• Finite subgraphs of uncountably chromatic graphs
• Superstable theories and representation
• A group version of stable regularity
• Regularity lemmas for stable graphs
• On chromatic number of graphs and set-systems
• Atomic compactness and elementary equivalence
• A Combinatorial Theorem