INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER

Yatir Halevi; Itay Kaplan; Saharon Shelah

doi:10.1090/tran/8570

INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER

Yatir Halevi, Itay Kaplan, Saharon Shelah

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We prove that if G = (V, E) is an ω-stable (respectively, superstable) graph with χ(G) > ℵ₀ (respectively, 2^ℵ⁰ ) 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.

Original language	English
Pages (from-to)	1767-1799
Number of pages	33
Journal	Transactions of the American Mathematical Society
Volume	375
Issue number	3
DOIs	https://doi.org/10.1090/tran/8570
State	Published - 1 Jan 2022

Keywords

Chromatic number
Stable graphs
Taylor’s conjecture

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.1090/tran/8570

Cite this

@article{486712b377ed4f96a577186fc192d3ec,

title = "INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER",

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 Shn(ω) 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.",

keywords = "Chromatic number, Stable graphs, Taylor{\textquoteright}s conjecture",

author = "Yatir Halevi and Itay Kaplan and Saharon Shelah",

note = "Publisher Copyright: {\textcopyright} 2021 American Mathematical Society.",

year = "2022",

month = jan,

day = "1",

doi = "10.1090/tran/8570",

language = "English",

volume = "375",

pages = "1767--1799",

journal = "Transactions of the American Mathematical Society",

issn = "0002-9947",

publisher = "American Mathematical Society",

number = "3",

}

TY - JOUR

T1 - INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER

AU - Halevi, Yatir

AU - Kaplan, Itay

AU - Shelah, Saharon

PY - 2022/1/1

Y1 - 2022/1/1

N2 - 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 Shn(ω) 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.

AB - 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 Shn(ω) 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.

KW - Chromatic number

KW - Stable graphs

KW - Taylor’s conjecture

UR - http://www.scopus.com/inward/record.url?scp=85124579115&partnerID=8YFLogxK

U2 - 10.1090/tran/8570

DO - 10.1090/tran/8570

M3 - Article

AN - SCOPUS:85124579115

SN - 0002-9947

VL - 375

SP - 1767

EP - 1799

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

IS - 3

ER -

INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this