Diversity and intersecting theorems for weak compositions
From MaRDI portal
Publication:6646382
DOI10.1016/j.disc.2024.114250MaRDI QIDQ6646382
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection problems in the \(q\)-ary cube
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- The complete intersection theorem for systems of finite sets
- Multiply union families in \(\mathbb{N}^n\)
- The exact bound in the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Erdős-Ko-Rado theorems for permutations and set partitions
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- The unbalance of set systems
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Two extremal problems on intersecting families
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On cross-intersecting families of set partitions
- Sharp results concerning disjoint cross-intersecting families
- Erdős-Ko-Rado theorems for set partitions with certain block size
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- An analogue of the Hilton-Milner theorem for set partitions
- On cross-intersecting families of sets
- Antichains of fixed diameter
- On \(r\)-cross intersecting families of set
- On r-Cross Intersecting Families of Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS
- AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS
- Improved bounds on the maximum diversity of intersecting families
This page was built for publication: Diversity and intersecting theorems for weak compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646382)
