scientific article; zbMATH DE number 3632542

MaRDI QIDQ4193510zbMATH OpenFDO

Authors Daniel J. Kleitman

Publication date 1979

zbMATH Keywords

Extremal Hypergraph Problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cited in

(18)

• A new proof of the colored Kruskal-Katona theorem
• Sums in the grid
• Matchings and paths in the cube
• Chvátal's conjecture and correlation inequalities
• Union of shadows
• Inverse additive problems for Minkowski sumsets. I
• Interpolating between volume and lattice point enumerator with successive minima
• A Brunn-Minkowski inequality for the integer lattice
• Erdös–Ko–Rado Theorem—22 Years Later
• Latent Subsets for Dual Intersecting Systems
• Collections of Subsets with the Sperner Property
• An approximate vertex-isoperimetric inequality for r-sets
• On the structure of subsets of the discrete cube with small edge boundary
• Supersaturation and stability for forbidden subposet problems.
• Properties of complexity measures for PRAMs and WRAMs
• A Note on the Erdös Distinct Subset Sums Problem
• On the number of iterations of local improvement algorithms
• Properties of two-dimensional sets with small sumset

This page was built for publication:

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