← All problems

Product formula for successive vertex orderings of the line graph of a bipartite 3-uniform hypergraph

21 years old · traced to

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.

References

6 papers in this index state this conjecture (2005–2022). The statement above is taken from the most recent of them; the others are arXiv:1806.07180, arXiv:1608.06053, arXiv:1210.2220, arXiv:1207.0074, arXiv:math/0501005.

Source: Lixing Fang, Hao Huang, Janos Pach, Gabor Tardos and Junchi Zuo, “Successive vertex orderings of fully regular graphs”, arXiv:2206.13592 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.