ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 22-edge-connected cubic graph, and let ω(G)\omega(G) denote its oddness, the minimum number of odd circuits in a 22-factor of GG. Lukoťka–Máčajová–Mazák–Škoviera conjecture. The graph GG has at least

7.5⋅ω(G)−57.5\cdot \omega(G)-5

vertices. This proposes a sharper lower bound than the previously proved bound 5.41⋅ω(G)5.41\cdot\omega(G) for bridgeless cubic graphs other than the Petersen graph; the status of the conjecture is not resolved in the supplied source.

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.