ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. We say that GG has KtK_t as an odd minor if there exist vertex-disjoint trees T1,…,Tt⊆GT_1,\dots,T_t\subseteq G and functions

χi:V(Ti)→{black,white}\chi_i:V(T_i)\to\{\text{black},\text{white}\}

for which each χi\chi_i is a proper 22-coloring of TiT_i, and for every i≠ji\ne j there are vertices xi∈V(Ti)x_i\in V(T_i) and xj∈V(Tj)x_j\in V(T_j) with {xi,xj}∈E(G)\{x_i,x_j\}\in E(G) and χi(xi)=χj(xj)\chi_i(x_i)=\chi_j(x_j).

Odd Hadwiger conjecture. If

χ(G)≥t,\chi(G)\geq t,

then GG has KtK_t as an odd minor. Equivalently, if GG does not have KtK_t as an odd minor, then

χ(G)<t.\chi(G)<t.

Gerards and Seymour proposed this parity-sensitive strengthening of Hadwiger's conjecture. The paper disproves it: for every fixed δ>0\delta>0 and all sufficiently large tt, there is a graph with χ(G)≥(32−δ)t\chi(G)\geq(\frac32-\delta)t having no KtK_t odd minor.

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.