Snark order-to-oddness ratio conjecture
Statement
Let be a snark, and let denote its oddness.
Snark order-to-oddness ratio conjecture. The order of satisfies
This is a proposed universal lower bound on the order of a snark in terms of its oddness. The source gives no proof or resolution.
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.