Kalai–Meshulam chromatic conjecture on induced cycles
Statement
Let be a graph, and let the chromatic number of be its minimum number of colors in a proper vertex coloring. An induced cycle is a cycle whose vertices induce exactly the edges of the cycle.
Kalai–Meshulam chromatic conjecture. A graph with high enough chromatic number has an induced cycle of length divisible by three.
This conjecture was proved by Bonamy, Charbit, and Thomassé, and later generalized by Scott and Seymour.
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.