Catalan-type formula for transitive partitions of the complete directed graph
Statement
For each integer , let denote the complete directed graph on vertices, and let denote the number of admissible partitions into blocks arising from the transitivity functor for . Transitivity enumeration conjecture.
This gives the next coefficient in the polynomial enumeration of transitive arrays; the supplied context does not state whether the formula has been proved or disproved.
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.