Odd-Hadwiger conjecture for signed graphs

Let (G,)(G,-) be a signed graph whose underlying graph is GG, with every edge negative, and let (Kk+1,)(K_{k+1},-) denote the complete graph on k+1k+1 vertices with every edge negative. A signed graph (H,π)(H,\pi) is a minor of (G,σ)(G,\sigma) if it is obtained by deleting vertices or edges, contracting positive edges, and switching. Odd-Hadwiger conjecture. If (G,)(G,-) has no (Kk+1,)(K_{k+1},-)-minor, then

χc(G,+)k.\chi_c(G,+)\leq k.

This conjecture strengthens the Hadwiger conjecture and generalizes Catlin's result, whose case k=3k=3 is stated in the source. Its status is not resolved in the supplied material.

Sources & referencesView supporting material

Primary source

Reza Naserasr, Zhouningxin Wang and Xuding Zhu, “Circular chromatic number of signed graphs”, arXiv:2010.07525 (2020).

Additional references

2 papers in this index state this conjecture (2019–2020). The statement above is taken from the most recent of them; the others are arXiv:1909.05982.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.