The smallest cyclically 4-connected snark with oddness 4
Statement
A snark is a connected cubic graph with no proper 3-edge-colouring. A snark is cyclically 4-connected if no edge-cut of size at most separates two subgraphs each containing a cycle. The oddness of a snark is the minimum number of odd circuits in a 2-factor. Smallest-order conjecture. The smallest cyclically -connected snark with oddness has vertices.
The construction described gives a cyclically -connected snark on vertices with oddness , improving the previously known smallest examples. The authors report that their other approaches also produced snarks of order , but no proof of minimality is given, so the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.