Taylor's conjecture on finite subgraphs of shift graphs
Taylor's conjecture on finite subgraphs of shift graphs
Let be a graph, and let denote its chromatic number. For , write for the corresponding shift graph on . Taylor's conjecture. If
then there exists an such that contains all finite subgraphs of . 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
Sign in to submit a solution.
No solutions have been posted yet.