ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Km,n(1,2)K_{m,n}^{(1,2)} be the 33-uniform hypergraph on V=V1∪V2V=V_1\cup V_2, with ∣V1∣=m|V_1|=m and ∣V2∣=n|V_2|=n, whose edges satisfy ∣e∩V1∣=1|e\cap V_1|=1 and ∣e∩V2∣=2|e\cap V_2|=2. Let L(Km,n(1,2))L(K_{m,n}^{(1,2)}) be its line graph, and let ai=(m−i)(n−2i2)a_i=(m-i)\binom{n-2i}{2}. Define

di=a0−aii.d_i=\frac{a_0-a_i}{i}.

Product-formula conjecture. The number of successive vertex orderings satisfies

σ′(L(Km,n(1,2)))=m⋅∏i=1m−1mn−(m+12)+(i2)di,\sigma'(L(K_{m,n}^{(1,2)}))=m\cdot\prod_{i=1}^{m-1}\frac{mn-\binom{m+1}{2}+\binom{i}{2}}{d_i},

where each fraction is evaluated after disregarding all zero factors in both the numerator and denominator.

The paper presents this as a product formula complementing an earlier summation formula. Its status is not resolved in the supplied text.

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.