• Corpus ID: 220713240

Infinite Stable Graphs With Large Chromatic Number

  title={Infinite Stable Graphs With Large Chromatic Number},
  author={Yatir Halevi and Itay Kaplan and Saharon Shelah},
  journal={arXiv: Logic},
We prove that if $G=(V,E)$ is an $\omega$-stable (respectively, superstable) graph with $\chi(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph $\text{Sh}_n(\omega)$ for some $n$. We prove a variant of this theorem for graphs interpretable in stationary stable theories. Furthermore, if $G$ is $\omega$-stable with $\mathrm{U}(G)\leq 2$ we prove that $n\leq 2$ suffices. 
2 Citations
Infinite Stable Graphs With Large Chromatic Number II
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 i2(א0) then G contains all finite subgraphs of Shn(ω)
1. Sh:a Saharon Shelah. Classification theory and the number of nonisomorphic models, volume 92 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam-New


Finite subgraphs of uncountably chromatic graphs
It is consistent that for every function f:ω → ω there is a graph with size and chromatic number ℵ1 in which every n‐chromatic subgraph contains at least f(n) vertices (n ≥ 3). This solves a $ 250
In Regularity Lemmas for Stable Graphs [1] Malliaris and Shelah apply tools from model theory to obtain stronger forms of Ramsey's theorem and Szemeredi's regularity lemma for stable graphs," graphs
A group version of stable regularity
Abstract We prove that, given ε > 0 and k ≥ 1, there is an integer n such that the following holds. Suppose G is a finite group and A ⊆ G is k-stable. Then there is a normal subgroup H ≤ G of index
Regularity lemmas for stable graphs
We develop a framework in which Szemeredi's celebrated Regularity Lemma for graphs interacts with core model-theoretic ideas and techniques. Our work relies on a coincidence of ideas from model
Cycles in graphs of uncountable chromatic number
It is shown that any graph of uncountable chromatic number contains an edge through which there are cycles of all (but finitely many) lengths.
What must and what need not be contained in a graph of uncountable chromatic number?
Two graphs are defined which are very similar and it is shown thatΓ is contained in every graph of uncountable chromatic number, whileΔ is (consistently) not.
A Combinatorial Theorem
Modèles saturés et modèles engendrés par des indiscernables
A complete answer is obtained in the case of stable theories: if T is stable then the three following properties are equivalent: (a) T is ω-stable, (b) T has an ℵ1-saturated ACI-model, (c) every saturated model of T is an Ehrenfeucht-Mostowski model.
Introduction 2 0.1. Some theorems in mathematics with snappy model-theoretic proofs 2 1. Languages, structures, sentences and theories 2 1.1. Languages 2 1.2. Statements and Formulas 5 1.3.