Taylor's conjecture on finite subgraphs of shift graphs
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.