Some Erdős-Ko-Rado theorems for injections
From MaRDI portal
Publication:966141
DOI10.1016/j.ejc.2009.07.013zbMath1226.05004OpenAlexW1989716787MaRDI QIDQ966141
Publication date: 27 April 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.07.013
Related Items
The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ 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 non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Strongly intersecting integer partitions ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ A Deza-Frankl type theorem for set partitions
Uses Software
Cites Work
- Unnamed Item
- 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.
- Intersecting and cross-intersecting families of labeled sets
- On the maximum number of permutations with given maximal or minimal distance
- The diametric theorem in Hamming spaces---optimal anticodes
- Stable sets of maximal size in Kneser-type graphs
- A simple proof of the Erdős-Chao Ko-Rado theorem
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- Erdős-Ko-Rado theorems for uniform set-partition systems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
- On a combinatorial conjecture of Erdös
- On intersecting families of finite sets
- Intersecting families of permutations