PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 17, 20250 citationsOpen Access

A complete t-intersection theorem for families of spanning trees

View Full Paper
EIElizaveta IarovikovaAKAndrey Kupavskii

Key Points

  • The study establishes the size of the largest t-intersecting family for spanning trees in complete graphs.
  • It shows that for n greater than n_0, families exist with significant t-intersections, revealing structural properties.
  • Analysis is conducted on the general condition of t values up to n-1, indicating a complete theorem solution.
  • The findings highlight a unique instance where a full t-intersection theorem for this structure is achieved.

Abstract

Let Tₙ denote the set of all labelled spanning trees of Kₙ. A family F Tₙ is t-intersecting if for all A, B F the trees A and B share at least t edges. In this paper, we determine for n>n₀ the size of the largest t-intersecting family F Tₙ for all meaningful values of t (t n-1). This result is a rare instance when a complete t-intersection theorem for a given type of structures is known.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Iarovikova et al. (2025) studied this question.

synapsesocial.com/papers/68f19f20de32064e504ddde1https://doi.org/10.48550/arxiv.2507.17913
Ask AI
Helpful
Bookmark
Share
View Full Paper