Pages that link to "Item:Q817754"

The following pages link to An Erdős--Ko--Rado theorem for partial permutations (Q817754):

Displaying 22 items.

• Structure of independent sets in direct products of some vertex-transitive graphs (Q270290) (← links)
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities (Q295831) (← links)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices (Q418897) (← links)
• Cross-intersecting families and primitivity of symmetric systems (Q618301) (← links)
• Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
• Strongly intersecting integer partitions (Q740661) (← links)
• A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
• Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
• On \(t\)-intersecting families of signed sets and permutations (Q1025955) (← links)
• The Erdős-Ko-Rado properties of various graphs containing singletons (Q1043643) (← links)
• Chromatic number via Turán number (Q2012520) (← links)
• Statistics of partial permutations via Catalan matrices (Q2104910) (← links)
• Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
• An Erdős-Ko-Rado theorem for restricted signed sets (Q2267280) (← links)
• On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
• On \(r\)-cross \(t\)-intersecting families for weak compositions (Q2339425) (← links)
• A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
• Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
• Maximum stable sets in analogs of Kneser and complete graphs (Q2519792) (← links)
• On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)