Akaria–Yuster's directed triangle packing conjecture for regular tournaments
Statement
Let be a regular tournament on vertices, where is odd. A collection of directed triangles is pairwise edge-disjoint if no directed edge belongs to more than one triangle. Akaria–Yuster's conjecture. Every regular tournament on vertices contains a collection of pairwise edge-disjoint directed triangles. The conjecture is motivated by the cyclic regular tournament, which attains the stated upper bound; the source notes that proving the bound for that tournament requires work and gives no resolution status.
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.