The signed-graph K5K_5-minor conjecture for maps to signed projective cubes

From papers

Let kk be a positive integer, let (G,σ)(G,\sigma) be a signed graph, let (K5,)(K_5,-) denote K5K_5 with all edges negative, and let Ok+1\mathcal{O}_{k+1} be the set of signed cycles that do not map to C(k+1)C_{-(k+1)}. A signed graph has neither a (K5,)(K_5,-)-minor nor an induced element of Ok+1\mathcal{O}_{k+1} when both conditions hold.

Signed-graph K5K_5-minor conjecture. Any signed graph (G,σ)(G,\sigma) which has neither a (K5,)(K_5,-)-minor nor induces an element of Ok+1\mathcal{O}_{k+1} maps to SPC(k)SPC(k).

This is presented as a deeper extension of the preceding conjecture, replacing ordinary minor-freeness by a signed-graph minor condition and extending the known characterization for signed partial 33-trees.

Progress summary

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

Sources & referencesView supporting material

Primary source

Meirun Chen and Reza Naserasr, “Bounding signed bipartite partial t-trees and application to edge-coloring”, arXiv:2511.14304 (2026).

Solutions 0

No solutions have been posted yet.