Some intersection theorems for finite sets
Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang

TL;DR
This paper investigates the structure and stability of maximum-sized non-trivial r-wise t-intersecting families of finite sets, and characterizes maximum product structures for 2-cross t-intersecting families.
Contribution
It provides a detailed description of the structure of non-trivial r-wise t-intersecting families with maximum size and establishes a stability result, also analyzing maximum product structures for 2-cross t-intersecting families.
Findings
Characterization of maximum non-trivial r-wise t-intersecting families.
Stability results for these families.
Structure determination of maximum product 2-cross t-intersecting families.
Abstract
Let , , and be positive integers with , and a family of -subsets of an -set . The families are said to be -cross -intersecting if for all and said to be non-trivial if . If the -cross -intersecting families satisfy , then is well known as -wise -intersecting family. In this paper, we describe the structure of non-trivial -wise -intersecting families with maximum size, and give a stability result for these families. We also determine the structure of non-trivial -cross -intersecting families with…
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
