ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph HH, let δχ(H)\delta_\chi(H) and δhom⁡(H)\delta_{\hom}(H) denote its chromatic and homomorphism thresholds, and let δpoly\mhyphenrem(H)\delta_{\mathrm{poly\mhyphen rem}}(H) denote its polynomial removal threshold. For the odd cycle C2k+1C_{2k+1} with k≥2k\geq 2, the odd-cycle removal-threshold conjecture.

δpoly\mhyphenrem(C2k+1)>δhom⁡(C2k+1)\delta_{\mathrm{poly\mhyphen rem}}(C_{2k+1})>\delta_{\hom}(C_{2k+1})

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.