On the maximum diversity of intersecting families of integer sequences
From MaRDI portal
Cites work
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Antichains of fixed diameter
- Diversity of uniform intersecting families
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3616474 (Why is no real title available?)
- scientific article; zbMATH DE number 3639626 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Improved bounds for the sunflower lemma
- Improved bounds on the maximum diversity of intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximum degree and diversity in intersecting hypergraphs
- On intersecting families of finite sets
- On maximal intersecting families of finite sets
- Pseudo sunflowers
- Spread approximations for forbidden intersections problems
- The Erdös-Ko-Rado Theorem for Integer Sequences
- The unbalance of set systems
This page was built for publication: On the maximum diversity of intersecting families of integer sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444077)