Erdős-Ko-Rado-type theorems for colored sets

zbMATH Open1111.05094MaRDI QIDQ870050FDOQ870050

Jun Wang, Yu-Shuang Li

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127274

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An Erdős-Ko-Rado theorem for restricted signed sets
• An Erdős--Ko--Rado theorem for partial permutations
• scientific article; zbMATH DE number 3900758
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• An Erdős-Ko-Rado-type theorem in Coxeter groups.

zbMATH Keywords

partial permutationsLYM-type inequality

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cited In (24)

• Basis theorems for continuous \(n\)-colorings
• An Erdős-Gallai type theorem for vertex colored graphs
• Erdős-Ko-Rado theorems in certain semilattices
• Erdős-Ko-Rado theorems of labeled sets
• Helly-type theorems for appropriate colorings of visibility sets
• The Erdős-Ko-Rado properties of various graphs containing singletons
• Structure of independent sets in direct products of some vertex-transitive graphs
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Size and structure of large \((s,t)\)-union intersecting families
• An infinite color analogue of Rado's theorem
• Cross-intersecting families and primitivity of symmetric systems
• 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
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• A Deza-Frankl type theorem for set partitions
• On \(t\)-intersecting families of signed sets and permutations
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• 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
• Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
• Strongly intersecting integer partitions

This page was built for publication: Erdős-Ko-Rado-type theorems for colored sets

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