MathDB

Non-snark conjecture for the beta family Gβ(m;a,b,c)G_\beta(m;a,b,c)

Let Gβ(m;a,b,c)G_\beta(m;a,b,c) be the beta family of cyclic graphs constructed in the paper. Beta-family non-snark conjecture. The graph Gβ(m;a,b,c)G_\beta(m;a,b,c) is never a snark. The displayed examples show 3-edge-colorings for several instances, but the supplied text gives no general resolution.

Sources & referencesView supporting material

Primary source

Leah Wrenn Berman, Déborah Oliveros and Gordon I. Williams, “Cyclic pseudo-Loupekine snarks”, arXiv:1707.05294 (2019).

graph-coloringrotational-symmetrysnarks

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.