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

DOI10.1016/J.DISC.2005.11.007zbMATH Open1088.05072OpenAlexW1991110565MaRDI QIDQ817754FDOQ817754

Authors: 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

Recommendations

• Erdős-Ko-Rado theorems for permutations and set partitions
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• An Erdős-Ko-Rado theorem for subset partitions
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
• An Erdős-Hajnal analogue for permutation classes
• The Erdős-Ko-Rado property for some permutation groups
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• A bipartite Erdős-Ko-Rado theorem
• A generalization of the Erdős-Ko-Rado theorem

zbMATH Keywords

intersecting families

Mathematics Subject Classification ID

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

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the maximum number of permutations with given maximal or minimal distance
• Stable sets of maximal size in Kneser-type graphs
• Intersecting families of permutations
• An Erdős-Ko-Rado theorem for signed sets
• Title not available (Why is that?)
• Extensions of the Erdös-Ko-Rado Theorem

Cited In (27)

• Erdős-Ko-Rado theorems in certain semilattices
• The Erdős-Ko-Rado properties of various graphs containing singletons
• Structure of independent sets in direct products of some vertex-transitive graphs
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Size and structure of large \((s,t)\)-union intersecting families
• Cross-intersecting families and primitivity of symmetric systems
• Some Results on the Sarkovskii Partial Ordering of Permutations
• Chromatic number via Turán number
• On the Chromatic Number of Matching Kneser Graphs
• Extremal \(G\)-free induced subgraphs of Kneser graphs
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• An Erdős-Ko-Rado theorem for restricted signed sets
• Erdős-Ko-Rado-type theorems for colored sets
• A Deza-Frankl type theorem for set partitions
• On \(t\)-intersecting families of signed sets and permutations
• Maximum stable sets in analogs of Kneser and complete graphs
• Two-Part and k-Sperner Families: New Proofs Using Permutations
• Statistics of partial permutations via Catalan matrices
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
• A non-trivial intersection theorem for permutations with fixed number of cycles
• Some Erdős-Ko-Rado theorems for injections
• On the maximum size of subfamilies of labeled set with given matching number
• On the general Erdős conjecture for perfect systems of difference sets and embedding partial complete permutations
• Strongly intersecting integer partitions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817754)