An Erdős--Ko--Rado theorem for partial permutations

DOI10.1016/j.disc.2005.11.007zbMath1088.05072MaRDI QIDQ817754

N. E. Zubov

Publication date: 20 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.007

zbMATH Keywords

intersecting families

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

05D05: Extremal set theory

Related Items

Structure of independent sets in direct products of some vertex-transitive graphs, 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 generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices, Cross-intersecting families and primitivity of symmetric systems, Strongly intersecting integer partitions, A non-trivial intersection theorem for permutations with fixed number of cycles, Some Erdős-Ko-Rado theorems for injections, On \(t\)-intersecting families of signed sets and permutations, The Erdős-Ko-Rado properties of various graphs containing singletons, Chromatic number via Turán number, An Erdős-Ko-Rado theorem for restricted signed sets, On \(r\)-cross \(t\)-intersecting families for weak compositions, A Deza-Frankl type theorem for set partitions, Erdős-Ko-Rado theorems in certain semilattices, Maximum stable sets in analogs of Kneser and complete graphs

Cites Work

• Unnamed Item
• On the maximum number of permutations with given maximal or minimal distance
• An Erdős-Ko-Rado theorem for signed sets
• Stable sets of maximal size in Kneser-type graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Extensions of the Erdös-Ko-Rado Theorem
• Intersecting families of permutations