Infinite Stable Graphs With Large Chromatic Number II

MaRDI QIDQ6363749zbMATH OpenFDO

Authors Yatir Halevi, Itay Kaplan, S. Shelah

Publication date 25 March 2021

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 $$ then $G$ contains all finite subgraphs of Sh${}_n(omega)$ 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.

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 Q6363749)