Intersecting families with covering number 3
From MaRDI portal
Cites work
- A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Improved bounds on the maximum diversity of intersecting families
- Intersecting families with covering number three
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Invitation to intersection problems for finite sets
- Maximum degree and diversity in intersecting hypergraphs
- On generalized graphs
- On hypergraph cliques with chromatic number 3
- On intersecting families of finite sets
- On the measure of intersecting families, uniqueness and stability
- On the size of maximal intersecting families
- Regular bipartite graphs and intersecting families
- Removal and stability for Erdős-Ko-Rado
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Spread approximations for forbidden intersections problems
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Structure of non-trivial intersecting families
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- The structure of large intersecting families
- Uniform intersecting families with covering number four
This page was built for publication: Intersecting families with covering number 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873947)
