Intersecting families of sets and permutations: a survey
Peter Borg

TL;DR
This survey reviews key results, conjectures, and open problems in extremal set theory related to $t$-intersecting families of sets and permutations across various important families, highlighting recent advances and extensions.
Contribution
It compiles and discusses known results, conjectures, and open problems in the study of $t$-intersecting families for multiple combinatorial structures, providing a comprehensive overview.
Findings
Summarizes major theorems and conjectures in $t$-intersecting families.
Highlights extensions and consequences of existing results.
Identifies open problems and directions for future research.
Abstract
A family of sets is said to be \emph{-intersecting} if any two sets in have at least common elements. A central problem in extremal set theory is to determine the size or structure of a largest -intersecting sub-family of a given family . We give a survey of known results, conjectures and open problems for various important families , namely, power sets, levels of power sets, hereditary families, families of signed sets, families of labeled sets, and families of permutations. We also provide some extensions and consequences of known results.
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 · graph theory and CDMA systems · Graph Labeling and Dimension Problems
