Extremal set theory for the binomial norm
From MaRDI portal
Publication:2010646
DOI10.1016/J.JCTA.2019.105144zbMATH Open1428.05303OpenAlexW2975981984WikidataQ127210106 ScholiaQ127210106MaRDI QIDQ2010646FDOQ2010646
Abstract: Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.
Recommendations
- Extremal Finite Set Theory
- Extremal problems for finite sets
- Extremal problems in finite sets
- Extremal problems on set systems
- Publication:4207927
- An extremal problem for sets: A new approach via Bezoutians
- Extremality of convex sets with some applications
- Extremal problems on complements of convex sets
- scientific article; zbMATH DE number 4085657
- On an extremal problem of set system
Cites Work
- A lower bound on the size of a complex generated by an antichain
- A short proof for a theorem of Harper about Hamming-spheres
- A short proof of Sperner's lemma
- Families of sets with no matchings of sizes 3 and 4
- Families with no s pairwise disjoint sets
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- Logarithmic order of free distributive lattice
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- Minimum saturated families of sets
- On generalized graphs
- Optimal numberings and isoperimetric problems on graphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
This page was built for publication: Extremal set theory for the binomial norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010646)
