The fixed-edge extremal conjecture for t-intersecting trees
Let be the complete graph on vertices, and let a family of spanning trees of be -intersecting if any two trees in the family have at least edges in common. For a fixed set of pairwise disjoint edges, write
Fixed-edge extremal conjecture. If , then the largest -intersecting family of spanning trees is
for some fixed set of disjoint edges.
This is a complete extremal prediction for the range . The paper presents it as an open problem, while later results may clarify its relation to the broader conjecture about trivial families.
References
- Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer, Andrey Kupavskii, Nathan Lindzey, Karen Meagher and Venkata Raghu Tej Pantangi, “Intersecting Families of Spanning Trees”, arXiv:2502.08128 (2025).
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.