The exact shortest-cycle conjecture for oriented 3-graphs
Statement
Let denote the minimum possible length of the shortest cycle in a tournament on vertices. Exact shortest-cycle conjecture. For and , we have
The preceding bounds show that this value is attainable by the construction in the paper and is a lower bound in the stated congruence classes; the conjecture asserts that the construction is best possible.
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.