Infinite stable graphs with large chromatic number. II

DOI10.4171/JEMS/1352MaRDI QIDQ6620342FDOQ6620342

Authors: Yatir Halevi, Itay Kaplan, S. Shelah 

Publication date: 16 October 2024

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

zbMATH Keywords

chromatic numberstable graphsTaylor's conjectureEM-models

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Classification theory and the number of non-isomorphic models
• Stable graphs
• Title not available (Why is that?)
• A course in model theory
• Title not available (Why is that?)
• Stable theories and representation over sets
• The chromatic number of infinite graphs - A survey
• A Guide to NIP Theories
• What must and what need not be contained in a graph of uncountable chromatic number?
• Models of axiomatic theories admitting automorphisms
• Autour De La Propriété Du Petit Indice
• Title not available (Why is that?)
• Regularity lemmas for stable graphs
• A group version of stable regularity
• Saturated models and models that are generated by indiscernibles
• Infinite stable graphs with large chromatic number

This page was built for publication: Infinite stable graphs with large chromatic number. II

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