An Erdős--Ko--Rado theorem for partial permutations
From MaRDI portal
(Redirected from Publication:817754)
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
Cites work
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- An Erdős-Ko-Rado theorem for signed sets
- Extensions of the Erdös-Ko-Rado Theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting families of permutations
- On the maximum number of permutations with given maximal or minimal distance
- Stable sets of maximal size in Kneser-type graphs
Cited in
(28)- Erdős-Ko-Rado-type theorems for colored sets
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- Structure of independent sets in direct products of some vertex-transitive graphs
- On the maximum size of subfamilies of labeled set with given matching number
- Two-Part and k-Sperner Families: New Proofs Using Permutations
- The Erdős-Ko-Rado properties of various graphs containing singletons
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Strongly intersecting integer partitions
- A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
- On the general Erdős conjecture for perfect systems of difference sets and embedding partial complete permutations
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- A non-trivial intersection theorem for permutations with fixed number of cycles
- Some Erdős-Ko-Rado theorems for injections
- Chromatic number via Turán number
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- A Deza-Frankl type theorem for set partitions
- Cross-intersecting families and primitivity of symmetric systems
- Statistics of partial permutations via Catalan matrices
- Extremal \(G\)-free induced subgraphs of Kneser graphs
- An Erdős-Ko-Rado theorem for integer sequences of given rank
- Some Results on the Sarkovskii Partial Ordering of Permutations
- On the chromatic number of matching Kneser graphs
- Erdős-Ko-Rado theorems in certain semilattices
- Size and structure of large \((s,t)\)-union intersecting families
- On \(t\)-intersecting families of signed sets and permutations
- An Erdős-Ko-Rado theorem for restricted signed sets
- Maximum stable sets in analogs of Kneser and complete graphs
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)
