Infinite stable graphs with large chromatic number. II

DOI10.4171/JEMS/1352MaRDI QIDQ6620342zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

• scientific article; zbMATH DE number 3468845 (Why is no real title available?)
• scientific article; zbMATH DE number 3262991 (Why is no real title available?)
• scientific article; zbMATH DE number 3383912 (Why is no real title available?)
• A Guide to NIP Theories
• A course in model theory
• A group version of stable regularity
• Autour De La Propriété Du Petit Indice
• Classification theory and the number of non-isomorphic models
• Infinite stable graphs with large chromatic number
• Models of axiomatic theories admitting automorphisms
• Regularity lemmas for stable graphs
• Saturated models and models that are generated by indiscernibles
• Stable graphs
• Stable theories and representation over sets
• The chromatic number of infinite graphs - A survey
• What must and what need not be contained in a graph of uncountable 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)