The maximum-diamond conjecture for tournaments of order congruent to 1 modulo 4
Statement
Let be a tournament on vertices. A diamond is the tournament configuration counted in the paper.
Maximum-diamond conjecture. The number of diamonds in is at most
This conjecture extends the preceding maximum-diamond results to tournaments whose order is congruent to modulo . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.