Polynomial removal threshold exceeds the homomorphism threshold for odd cycles
Statement
For a graph , let and denote its chromatic and homomorphism thresholds, and let denote its polynomial removal threshold. For the odd cycle with , the odd-cycle removal-threshold conjecture.
This would separate the polynomial removal and homomorphism thresholds for every odd cycle of length at least five; determining these thresholds is presented as an open problem in the surrounding discussion.
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.