MODNET
Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1819

Preprint Number 1819

Previous Next Preprint server


1819. Yatir Halevi, Itay Kaplan, Saharon Shelah
Infinite Stable Graphs With Large Chromatic Number
E-mail:

Submission date: 23 July 2020

Abstract:

We prove that if G=(V,E) is an ω-stable (respectively, superstable) graph with χ(G)>ℵ_0 (respectively, 2^{ℵ_0}) then G contains all the finite subgraphs of the shift graph Sh_n(ω) for some n. We prove a variant of this theorem for graphs interpretable in stationary stable theories. Furthermore, if G is ω-stable with U(G) ≤ 2 we prove that n ≤ 2 suffices.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 2007.12139: pdf, ps.


Last updated: March 23 2021 09:21 Please send your corrections to: