Multiply-intersecting families
From MaRDI portal
Publication:1186135
DOI10.1016/0095-8956(91)90075-UzbMath0755.05093MaRDI QIDQ1186135
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (16)
Multiply-intersecting families revisited ⋮ Some exact results for multiply intersecting families ⋮ Non-trivial \(r\)-wise intersecting families ⋮ A proof of Frankl–Kupavskii's conjecture on edge‐union condition ⋮ Strong stability of 3-wise \(t\)-intersecting families ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ Diversity ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ A product version of the Erdős-Ko-Rado theorem ⋮ Multiply union families in \(\mathbb{N}^n\) ⋮ Invitation to intersection problems for finite sets ⋮ VC dimension and a union theorem for set systems ⋮ On r-Cross Intersecting Families of Sets ⋮ Multiply intersecting families of sets ⋮ Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration ⋮ An extension of the Erdős–Ko–Rado Theorem
Cites Work
- Unnamed Item
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem
- On coverings of a finite set: Depth and subcovers
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Families of finite sets satisfying a union condition
- Matchings and covers in hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Sets of finite sets satisfying union conditions
- A Helly Theorem for Sets
- Families of finite sets satisfying an intersection condition
- Intersection theorems for systems of finite sets
- A finite set covering theorem
This page was built for publication: Multiply-intersecting families