ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X1,X2X_1,X_2 and X3X_3 be the partite sets of the complete tripartite graph Kn1,n2,n3K_{n_1,n_2,n_3}, where ∣Xi∣=ni|X_i|=n_i for i∈⟦3⟧i\in \llbracket 3\rrbracket. Let FF be a spanning forest in Kn1,n2,n3K_{n_1,n_2,n_3} with kk components T1,T2,…,TkT_1,T_2,\ldots,T_k. Write n=n1+n2+n3n=n_1+n_2+n_3 and ns,i=∣Xs∩V(Ti)∣n_{s,i}=|X_s\cap V(T_i)| for s=1,2,3s=1,2,3 and i∈⟦k⟧i\in \llbracket k\rrbracket. The lower-bound conjecture. The number τF(Kn1,n2,n3)\tau_F(K_{n_1,n_2,n_3}) of spanning trees of Kn1,n2,n3K_{n_1,n_2,n_3} containing all edges of FF satisfies

τF(Kn1,n2,n3)≥1n1n2+n1n3+n2n3(∏i=1k((n−n1)n1,i+(n−n2)n2,i+(n−n3)n3,i))\tau_F(K_{n_1,n_2,n_3})\geq \frac{1}{n_1n_2+n_1n_3+n_2n_3}\left(\prod_{i=1}^{k}\left((n-n_1)n_{1,i}+(n-n_2)n_{2,i}+(n-n_3)n_{3,i}\right)\right) ⋅(1−∑i=1kn1,in2,i+n1,in3,i+n2,in3,i(n−n1)n1,i+(n−n2)n2,i+(n−n3)n3,i).\qquad\cdot\left(1-\sum_{i=1}^{k}\frac{n_{1,i}n_{2,i}+n_{1,i}n_{3,i}+n_{2,i}n_{3,i}}{(n-n_1)n_{1,i}+(n-n_2)n_{2,i}+(n-n_3)n_{3,i}}\right).

This conjecture seeks a general lower bound for the number of spanning trees containing a prescribed spanning forest in a complete tripartite graph; its status is not resolved in the supplied source material.

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.