The irreducible-snark defect-3 conjecture

Let GG be an irreducible snark, meaning a snark for which deleting any pair of distinct vertices produces a 33-edge-colourable graph, and let defect denote colouring defect. Irreducible-snark defect-3 conjecture.

defect(G)=3.\operatorname{defect}(G)=3.

Irreducible snarks form a subfamily of critical snarks, so this is presented as a weaker consequence of the critical-snark conjectures. Its general status is open.

Sources & referencesView supporting material

Primary source

Ján Karabáš, Edita Máčajová, Roman Nedela and Martin Škoviera, “Cubic graphs with colouring defect 3”, arXiv:2308.13639 (2023).

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.