A Common Generalization to Theorems on Set Systems with $\mathcal{L}$-intersections
Jiuqiang Liu, Shenggui Zhang, Jimeng Xiao

TL;DR
This paper unifies and generalizes several classical theorems on set systems with intersection properties, providing new bounds and results applicable to both set families and subspace families over finite fields.
Contribution
It introduces a unified framework that generalizes multiple intersection theorems, leading to stronger bounds and extending results to vector space subfamilies over finite fields.
Findings
Unified generalization of classical intersection theorems
Stronger bounds for set systems with $ ext{L}$-intersections
Extension of results to subspace families over finite fields
Abstract
In this paper, we provide a common generalization to the well-known Erd\H{o}s-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with -intersections. As a consequence, we derive a result which strengthens substantially the well-known theorem on set systems with -wise -intersections by Fredi and Sudakov [J. Combin. Theory, Ser. A (2004) 105: 143-159]. We will also derive similar results on -intersecting families of subspaces of an -dimensional vector space over a finite field , where is a prime power.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · graph theory and CDMA systems
