For a d-tournament on n vertices, obtained by assigning a compatible orientation to every d-set, what is the greatest possible number of directed (d+1)-sets?
Statement
For a d-tournament on n vertices, obtained by assigning a compatible orientation to every d-set, what is the greatest possible number of directed (d+1)-sets? Equivalently, how does the limiting density c_d of directed (d+1)-sets behave for fixed d and as d grows?
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.