Improved bounds concerning the maximum degree of intersecting hypergraphs
From MaRDI portal
Publication:6574372
Recommendations
Cites work
- 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 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- A product version of the Hilton-Milner-Frankl theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Families are Essentially Contained in Juntas
- Intersection theorems for systems of finite sets
- Intersections and distinct intersections in cross-intersecting families
- On \(r\)-cross intersecting families of sets
- On intersecting families of finite sets
- On strengthenings of the intersecting shadow theorem
- On the maximum of the sum of the sizes of non-trivial cross-intersecting families
- Simple juntas for shifted families
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- The exact bound in the Erdős-Ko-Rado theorem
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The size of a hypergraph and its matching number
This page was built for publication: Improved bounds concerning the maximum degree of intersecting hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574372)