Aldred–Labbate–Robertson–Seymour conjecture on cyclically 5-edge-connected odd 2-factored snarks
Aldred–Labbate–Robertson–Seymour conjecture on cyclically 5-edge-connected odd 2-factored snarks
Let be a cyclically -edge-connected odd -factored snark, where a snark is a bridgeless cubic graph of chromatic index four and odd 2-factored means that every cycle in every -factor is odd. Let be the Petersen graph and the Flower snark. Aldred–Labbate–Robertson–Seymour's conjecture. The graph is either the Petersen graph or the Flower snark for odd . This is a proposed partial characterization after earlier constructions produced counterexamples to the broader odd -factored snark conjecture.
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
D. Labbate and F. Romaniello, “An updated survey on 2-Factors of Regular Graphs”, arXiv:2408.04642 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.