Lukoťka–Máčajová–Mazák–Škoviera conjecture on the order of cubic graphs of given oddness
Statement
Let be a -edge-connected cubic graph, and let denote its oddness, the minimum number of odd circuits in a -factor of . Lukoťka–Máčajová–Mazák–Škoviera conjecture. The graph has at least
vertices. This proposes a sharper lower bound than the previously proved bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.