An analogue of the Erdős-Ko-Rado theorem for weak compositions
From MaRDI portal
Publication:389467
DOI10.1016/j.disc.2013.07.012zbMath1279.05001OpenAlexW2009449074MaRDI QIDQ389467
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.012
Related Items (10)
The maximum product of sizes of cross-intersecting families ⋮ A short proof of an Erdős-Ko-Rado theorem for compositions ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Unnamed Item ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Stability for \(t\)-intersecting families of permutations
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- 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
- Some Erdős-Ko-Rado theorems for injections
- 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 properties of various graphs containing singletons
- The Erdős-Ko-Rado theorem for vector spaces
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- On the maximum number of permutations with given maximal or minimal distance
- The diametric theorem in Hamming spaces---optimal anticodes
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- Stable sets of maximal size in Kneser-type graphs
- On cross-intersecting families of set partitions
- Shadows and intersections in vector spaces
- An analogue of the Hilton-Milner theorem for set partitions
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Erdős-Ko-Rado theorems for simplicial complexes
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal t -intersecting sub-families of hereditary families
- Intersecting families of permutations
- Intersecting families of permutations
This page was built for publication: An analogue of the Erdős-Ko-Rado theorem for weak compositions