Infinite stable graphs with large chromatic number. II

DOI10.4171/jems/1352MaRDI QIDQ6620342

Yatir Halevi, Itay Kaplan, Saharon Shelah

Publication date: 16 October 2024

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

zbMATH Keywords

stable graphschromatic numberTaylor's conjectureEM-models

Mathematics Subject Classification ID

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

Cites Work

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

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)