Strongly intersecting integer partitions
From MaRDI portal
Publication:740661
DOI10.1016/j.disc.2014.07.018zbMath1297.05025arXiv1304.6563OpenAlexW2029419482MaRDI QIDQ740661
Publication date: 4 September 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6563
Related Items (4)
The maximum product of sizes of cross-intersecting families ⋮ Erdös-Ko-Rado theorems for a family of trees ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Katona's intersection theorem: four proofs
- On Chvàtal's conjecture and a conjecture on families of signed sets
- Cross-intersecting families and primitivity of symmetric systems
- The complete intersection theorem for systems of finite sets
- An ordered version of the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- More on the Erdős-Ko-Rado theorem for integer sequences
- An Erdős--Ko--Rado theorem for partial permutations
- Erdős-Ko-Rado-type theorems for colored sets
- 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
- Intersecting and cross-intersecting families of labeled sets
- 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 properties of set systems defined by double partitions
- The Erdős-Ko-Rado theorem for vector spaces
- A new result on Chvátal's conjecture
- Intersection theorems for systems of finite vector spaces
- On the maximum number of permutations with given maximal or minimal distance
- The diametric theorem in Hamming spaces---optimal anticodes
- The Erdős-Ko-Rado bound for the function lattice
- An Erdős-Ko-Rado theorem for signed sets
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- Stable sets of maximal size in Kneser-type graphs
- Erdős-Ko-Rado from Kruskal-Katona
- Intersecting systems of signed sets
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Erdős-Ko-Rado theorems for simplicial complexes
- The maximum sum and the maximum product of sizes of cross-intersecting families
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal t -intersecting sub-families of hereditary families
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- INTERSECTING FAMILIES OF SEPARATED SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
- Intersecting families of permutations
- Intersecting families of permutations
- The Erdős-Ko-Rado theorem for integer sequences
- An intersection theorem for weighted sets
This page was built for publication: Strongly intersecting integer partitions