Jiménez–Quiroz–Thraves Caro totally odd immersion conjecture
Statement
For a graph , let be the maximum integer such that contains a totally odd strong immersion of , and let denote its chromatic number. Jiménez–Quiroz–Thraves Caro conjecture. For every graph , we have
This extends the immersion–chromatic number conjecture to dense graph classes, including complete bipartite graphs, for which the ordinary immersion parameter can behave differently. The source presents it as an open conjecture and cites inspiration from Churchley’s work.
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.