Kleitman and combinatorics

DOI10.1016/S0012-365X(02)00596-4zbMath1008.05148OpenAlexW1966021662MaRDI QIDQ1850009

Michael E. Saks

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00596-4

zbMATH Keywords

asymptotic enumerationdiscrete geometryextremal combinatorics

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Asymptotic enumeration (05A16) Combinatorial geometries and geometric closure systems (51D20)

Related Items (4)

Applications of graph containers in the Boolean lattice ⋮ Interview with Gil Kalai ⋮ Partition problems in high dimensional boxes ⋮ On the number of union-free families

This page was built for publication: Kleitman and combinatorics