Casselgren, Petros and Fufa's Cartesian-product edge-precoloring conjecture
Casselgren, Petros and Fufa's Cartesian-product edge-precoloring conjecture
Let be a graph, let be a precoloring of some edges of , and let be extendable if it extends to a proper edge-coloring with colors. Let denote the Cartesian product of graphs and .
Casselgren, Petros and Fufa's conjecture. If every precoloring of at most edges of can be extended to a proper -edge-coloring, then every precoloring of at most edges of is extendable to a proper -edge-coloring of .
This conjecture is presented as a far-reaching generalization of the hypercube extension result. It is known for trees, complete and complete bipartite graphs, and graphs with small maximum degree; the general case 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
Sign in to submit a solution.
No solutions have been posted yet.