The Erdős-Ko-Rado properties of various graphs containing singletons
From MaRDI portal
(Redirected from Publication:1043643)
Recommendations
Cites work
- scientific article; zbMATH DE number 5130735 (Why is no real title available?)
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3472087 (Why is no real title available?)
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- An Erdős--Ko--Rado theorem for partial permutations
- An Erdős-Ko-Rado theorem for signed sets
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- Compression and Erdős-Ko-Rado graphs
- Erdös–Ko–Rado Theorem—22 Years Later
- Erdős-Ko-Rado with separation conditions
- Erdős-Ko-Rado-type theorems for colored sets
- Extremal t -intersecting sub-families of hereditary families
- Graphs with the Erdős-Ko-Rado property
- INTERSECTING FAMILIES OF SEPARATED SETS
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting families of permutations
- Intersecting systems of signed sets
- On the maximum number of permutations with given maximal or minimal distance
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Erdős-Ko-Rado properties of set systems defined by double partitions
Cited in
(26)- Cross-intersecting subfamilies of levels of hereditary families
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- On the star of the family of independent sets in a graph
- Erdös-Ko-Rado theorem for ladder graphs
- An Erdős-Ko-Rado theorem for unions of length 2 paths
- Compression and Erdős-Ko-Rado graphs
- Graphs with the Erdős-Ko-Rado property
- On stars in caterpillars and lobsters
- Very well-covered graphs with the Erdős-Ko-Rado property
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Erdős-Ko-Rado theorems for simplicial complexes
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Cross-intersecting non-empty uniform subfamilies of hereditary families
- Strongly intersecting integer partitions
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- Non-trivial intersecting uniform sub-families of hereditary families
- Erdös-Ko-Rado theorems for a family of trees
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
- On the Holroyd-Talbot conjecture for sparse graphs
- A non-trivial intersection theorem for permutations with fixed number of cycles
- Restricted intersecting families on simplicial complex
- A Deza-Frankl type theorem for set partitions
- On intersecting families of independent sets in trees
- Stars on trees
- Erdős-Ko-Rado type theorems for simplicial complexes
- The number of \(s\)-separated \(k\)-sets in various circles
This page was built for publication: The Erdős-Ko-Rado properties of various graphs containing singletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043643)
