On \(r\)-cross \(t\)-intersecting families for weak compositions
From MaRDI portal
Publication:2339425
DOI10.1016/j.disc.2015.01.015zbMath1309.05177arXiv1311.1813OpenAlexW2104078069MaRDI QIDQ2339425
Publication date: 1 April 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.1813
Related Items (5)
The maximum product of sizes of cross-intersecting families ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Unnamed Item ⋮ A Deza-Frankl type theorem for set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- A product version of the Erdős-Ko-Rado theorem
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- An Erdős--Ko--Rado theorem for partial permutations
- Erdős-Ko-Rado-type theorems for colored sets
- Intersecting families in the alternating group and direct product of symmetric groups
- An Erdős-Ko-Rado-type theorem in Coxeter groups.
- 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
- On \(t\)-intersecting families of signed sets and permutations
- The Erdős-Ko-Rado theorem for vector spaces
- On the maximum number of permutations with given maximal or minimal distance
- Stable sets of maximal size in Kneser-type graphs
- On cross-intersecting families of set partitions
- An analogue of the Hilton-Milner theorem for set partitions
- On cross-intersecting families of sets
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- The maximum product of sizes of cross-$t$-intersecting uniform families
- On r-Cross Intersecting Families of Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting families of permutations
- Intersecting families of permutations
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: On \(r\)-cross \(t\)-intersecting families for weak compositions