ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let toi⁡(G)\operatorname{toi}(G) be the maximum integer tt such that GG contains a totally odd strong immersion of KtK_t, and let χ(G)\chi(G) denote its chromatic number. Jiménez–Quiroz–Thraves Caro conjecture. For every graph GG, we have

χ(G)≤toi⁡(G).\chi(G)\leq \operatorname{toi}(G).

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 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.