ProbXiv
Explorersign in
Problem archiveProblem record

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 33 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 44-connected snark with oddness 44 has 4444 vertices.

The construction described gives a cyclically 44-connected snark on 4444 vertices with oddness 44, improving the previously known smallest examples. The authors report that their other approaches also produced snarks of order 4444, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.