ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a regular tournament on nn vertices, where nn 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 TT on nn vertices contains a collection of n2/9+o(n2)n^2/9 + o(n^2) 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 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.