scientific article; zbMATH DE number 3472087
From MaRDI portal
Publication:4055666
Cited in
(23)- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- On t-intersecting families of signed sets and permutations
- The Erdős-Ko-Rado properties of various graphs containing singletons
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Embedding maximal cliques of sets in maximal cliques of bigger sets
- More on maximal intersecting families of finite sets
- On maximal intersecting families of finite sets
- Nombres de coloration de l'hypergraphe h-parti complet
- Erdös-Ko-Rado theorems for a family of trees
- Compression and Erdős-Ko-Rado graphs
- Maximal intersecting families and affine regular polygons in PG(2,q)
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Erdös–Ko–Rado Theorem—22 Years Later
- A Hilton-Milner-type theorem and an intersection conjecture for signed sets
- Erdős-Ko-Rado theorems of labeled sets
- On Chvàtal's conjecture and a conjecture on families of signed sets
- On the star of the family of independent sets in a graph
- Non-trivial \(t\)-intersecting separated families
- Intersection problems and a correlation inequality for integer sequences
- On intersecting families of subgraphs of perfect matchings
- Non-trivial intersecting and non-empty cross-intersecting families of independent sets in graphs
- Strongly intersecting integer partitions
- Multiple cross-intersecting families of signed sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055666)
