Edge-precoloring conjecture for Cartesian products with balanced complete bipartite graphs

From papers

Let GG be an rr-regular, triangle-free graph, and let Kn,nK_{n,n} be the complete bipartite graph with parts of size nn. Let GKn,nG \square K_{n,n} denote their Cartesian product.

Balanced complete-bipartite Cartesian-product conjecture. If any precoloring of at most k<rk < r edges of GG can be extended to a proper χ(G)\chi'(G)-edge-coloring of GG, then any precoloring of at most k+nk+n edges of GKn,nG \square K_{n,n} can be extended to a proper (χ(G)+n)(\chi'(G)+n)-edge-coloring of GKn,nG \square K_{n,n}.

This conjecture is suggested as a generalization beyond the cases already known for stars, even cycles, and trees. Its resolution, or the analogous statement for Kn,mK_{n,m}, would have implications for hypercube precoloring-extension problems; the conjecture remains open.

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

Pál Bärnkopf and Ervin Győri, “Extending partial edge-colorings of bounded size in Cartesian products of graphs”, arXiv:2603.23139 (2026).

Solutions 0

No solutions have been posted yet.