ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T=(V,A)T=(V,A) be a tournament on n≡1(mod4)n\equiv 1\pmod{4} vertices. A diamond is the tournament configuration counted in the paper.

Maximum-diamond conjecture. The number of diamonds in TT is at most

196(n+3)(n−1)(n−2)(n−3).\frac{1}{96}(n+3)(n-1)(n-2)(n-3).

This conjecture extends the preceding maximum-diamond results to tournaments whose order is congruent to 11 modulo 44. The supplied text does not state a resolution, so its status is open.

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.