Taylor's conjecture on finite subgraphs of shift graphs

From papers

Let GG be a graph, and let χ(G)\chi(G) denote its chromatic number. For nNn\in\mathbb{N}, write Shn(ω)\operatorname{Sh}_n(\omega) for the corresponding shift graph on ω\omega. Taylor's conjecture. If

χ(G)>0,\chi(G)>\aleph_0,

then there exists an nNn\in\mathbb{N} such that GG contains all finite subgraphs of Shn(ω)\operatorname{Sh}_n(\omega). The strong Taylor's conjecture was refuted, so this original conjecture is recorded here as a solved claim rather than as an open conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yatir Halevi, Itay Kaplan and Saharon Shelah, “Infinite Stable Graphs With Large Chromatic Number II”, arXiv:2103.13931 (2021).

Additional references

2 papers in this index state this conjecture (2020–2021). The statement above is taken from the most recent of them; the others are arXiv:2007.12139.

Solutions 0

No solutions have been posted yet.