A lower bound on the size of a complex generated by an antichain

DOI10.1016/0012-365X(89)90287-2zbMath0671.05004MaRDI QIDQ1119639

Peter Frankl

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

antichainHarper's isoperimetric theoremtotal number of sets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (8)

New results on edge-bandwidth ⋮ On Sums of Generating Sets in ℤ₂ⁿ ⋮ Stability for vertex isoperimetry in the cube ⋮ On diagnosability of large multiprocessor networks ⋮ On cross-intersecting families ⋮ Extremal set theory for the binomial norm ⋮ Invitation to intersection problems for finite sets ⋮ Antibandwidth and cyclic antibandwidth of meshes and hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new short proof for the Kruskal-Katona theorem
• A short proof for a theorem of Harper about Hamming-spheres
• The minimal number of basic elements in a multiset antichain
• Extremal problems for finite sets and convex hulls---a survey
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• On subsets containing a family of non-commensurable subsets of a finite set
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: A lower bound on the size of a complex generated by an antichain