Publication:5148147
From MaRDI portal
DOI10.4134/BKMS.b190301zbMath1456.05168MaRDI QIDQ5148147
Publication date: 1 February 2021
Cites Work
- Unnamed Item
- Unnamed Item
- 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 permutations with fixed number of cycles
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- A product version of the Erdős-Ko-Rado theorem
- Stability for \(t\)-intersecting families of permutations
- 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 for cross-intersecting families
- A non-trivial intersection theorem for permutations with fixed number of cycles
- 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
- The Erdős-Ko-Rado theorem for vector spaces
- The diametric theorem in Hamming spaces---optimal anticodes
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On cross-intersecting families of set partitions
- Shadows and intersections in vector spaces
- Erdős-Ko-Rado theorems for set partitions with certain block size
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- A Deza-Frankl type theorem for set partitions
- 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 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
- Intersecting families of permutations
- Intersecting families of permutations
- A new generalization of the Erdős-Ko-Rado theorem
