On \(t\)-intersecting families of signed sets and permutations
From MaRDI portal
Publication:1025955
DOI10.1016/j.disc.2008.09.039zbMath1216.05003OpenAlexW2151762588MaRDI QIDQ1025955
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.039
Related Items
The maximum product of sizes of cross-intersecting families ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ On Chvàtal's conjecture and a conjecture on families of signed sets ⋮ A Hilton-Milner-type theorem and an intersection conjecture for signed sets ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ Cross-intersecting families and primitivity of symmetric systems ⋮ 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 ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ Strongly intersecting integer partitions ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions ⋮ The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
- On the maximum number of permutations with given maximal or minimal distance
- The diametric theorem in Hamming spaces---optimal anticodes
- Extremal problems for finite sets and convex hulls---a survey
- An Erdős-Ko-Rado theorem for signed sets
- 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
- 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
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- The Erdös-Ko-Rado Theorem for Integer Sequences
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting families of permutations
- The Erdős-Ko-Rado theorem for integer sequences
