Kleitman and combinatorics

DOI10.1016/S0012-365X(02)00596-4MaRDI QIDQ1850009zbMATH OpenOpenAlexFDO

Authors Michael 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

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

Review text

This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.

Cited in

(8)

• Partition problems in high dimensional boxes
• On the number of union-free families
• Applications of graph containers in the Boolean lattice
• On a combinatorial principle of Hajnal and Komjáth
• scientific article; zbMATH DE number 1304028 (Why is no real title available?)
• Interview with Gil Kalai
• Periods of strongly connected multivariate digraphs
• The algorithmic power of the Greene-Kleitman theorem

This page was built for publication: Kleitman and combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850009)