Erdős-Ko-Rado-type theorems for colored sets
From MaRDI portal
Publication:870050
zbMath1111.05094MaRDI QIDQ870050
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
Related Items (19)
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 ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ An Erdős-Ko-Rado-type theorem in Coxeter groups. ⋮ Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups ⋮ Some Erdős-Ko-Rado theorems for injections ⋮ 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 ⋮ Strongly intersecting integer partitions ⋮ 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
This page was built for publication: Erdős-Ko-Rado-type theorems for colored sets
