Infinite stable graphs with large chromatic number II

Yatir Halevi, Itay Kaplan, Saharon Shelah

Research output: Contribution to journalArticlepeer-review

Abstract

We prove a version of the strong Taylor’s conjecture for stable graphs: if G is a stable graph whose chromatic number is strictly greater than ℑ20) then G contains all finite subgraphs of Shn(ω) and thus has elementary extensions of unbounded chromatic number. This completes the picture from our previous work. The main new model-theoretic ingredient is a generalization of the classical construction of Ehrenfeucht–Mostowski models to an infinitary setting, giving a new characterization of stability.

Original languageEnglish
Pages (from-to)4585-4614
Number of pages30
JournalJournal of the European Mathematical Society
Volume26
Issue number12
DOIs
StatePublished - 2024

Bibliographical note

Publisher Copyright:
© 2023 European Mathematical Society.

Keywords

  • Chromatic number
  • EM-models
  • stable graphs
  • Taylor’s conjecture

Fingerprint

Dive into the research topics of 'Infinite stable graphs with large chromatic number II'. Together they form a unique fingerprint.

Cite this