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

DOI10.1016/j.disc.2005.11.007zbMath1088.05072OpenAlexW1991110565MaRDI 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

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (22)

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 ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ 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 ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Some Erdős-Ko-Rado theorems for injections ⋮ Chromatic number via Turán number ⋮ An Erdős-Ko-Rado theorem for restricted signed sets ⋮ On the maximum size of subfamilies of labeled set with given matching number ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Maximum stable sets in analogs of Kneser and complete graphs ⋮ Strongly intersecting integer partitions ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On \(t\)-intersecting families of signed sets and permutations ⋮ The Erdős-Ko-Rado properties of various graphs containing singletons ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions ⋮ Statistics of partial permutations via Catalan matrices

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

This page was built for publication: An Erdős--Ko--Rado theorem for partial permutations