The strengthened cycle-free chromatic discrepancy conjecture
Statement
Let be a graph. For an integer , call -free if it contains no cycle of length exactly as a, not necessarily induced, subgraph. Let denote the complete graph on vertices, and let denote the chromatic discrepancy of .
Strengthened cycle-free chromatic discrepancy conjecture. For every integer , every -free graph satisfies
The source presents this as a stronger conjecture motivated by the suspicion that equality in the weaker bound occurs only when or when is complete. Its status is not otherwise resolved in the supplied text.
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.