ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer n≥3n\ge 3, let K⃗n\vec K_n denote the complete directed graph on nn vertices, and let {K⃗nn−2}\genfrac{\{} {\}}{0pt}1{\vec K_n}{n-2} denote the number of admissible partitions into n−2n-2 blocks arising from the transitivity functor for K⃗n\vec K_n. Transitivity enumeration conjecture.

{K⃗nn−2}=(n−2)(2n−3n)+(2(n−2)n).\genfrac{\{} {\}}{0pt}1{\vec K_n}{n-2}=(n-2)\binom{2n-3}{n}+\binom{2(n-2)}{n}.

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 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.