Extremal set theory for the binomial norm

DOI10.1016/j.jcta.2019.105144zbMath1428.05303arXiv1904.10292OpenAlexW2975981984WikidataQ127210106 ScholiaQ127210106MaRDI QIDQ2010646

Peter Frankl

Publication date: 27 November 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10292

zbMATH Keywords

extremal problemsfinite setsbinomial inequalitiespairwise disjoint subsets

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Extremal set theory (05D05)

Related Items (1)

On families with bounded matching number

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
• Families of sets with no matchings of sizes 3 and 4
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• Logarithmic order of free distributive lattice
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Minimum saturated families of sets
• Intersection theorems for systems of finite sets
• Families with no s pairwise disjoint sets
• On generalized graphs
• A short proof of Sperner's lemma
• Optimal numberings and isoperimetric problems on graphs
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set

This page was built for publication: Extremal set theory for the binomial norm