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 ℑ2(ϰ0) 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 language | English |
---|---|
Pages (from-to) | 4585-4614 |
Number of pages | 30 |
Journal | Journal of the European Mathematical Society |
Volume | 26 |
Issue number | 12 |
DOIs | |
State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2023 European Mathematical Society.
Keywords
- Chromatic number
- EM-models
- stable graphs
- Taylor’s conjecture