Maximum degree and diversity in intersecting hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Diversity of uniform intersecting families
- Erdős-Ko-Rado from Kruskal-Katona
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximum degree and fractional matchings in uniform hypergraphs
- On intersecting families of finite sets
- Regular bipartite graphs and intersecting families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The unbalance of set systems
- Two extremal problems on intersecting families
Cited in
(12)- Finite projective spaces and intersecting hypergraphs
- Minimum degree and diversity in intersecting antichains
- A generalization of diversity for intersecting families
- Improved bounds on the maximum diversity of intersecting families
- Shattered matchings in intersecting hypergraphs
- Diversity
- On the Holroyd-Talbot conjecture for sparse graphs
- On diversity of certain \(t\)-intersecting families
- Maximum size intersecting families of bounded minimum positive co-degree
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- Diversities and the Geometry of Hypergraphs
This page was built for publication: Maximum degree and diversity in intersecting hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777477)