A simple proof of the Kruskal-Katona theorem

DOI10.1016/0097-3165(74)90012-0zbMath0287.05004MaRDI QIDQ1845728

David E. Daykin

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90012-0

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

03E05: Other combinatorial set theory

Related Items

Über einen Satz von Kruskal, Über einen Satz von Kruskal, A new short proof for the Kruskal-Katona theorem, Compressions and isoperimetric inequalities, On learning monotone Boolean functions under the uniform distribution, Shadows and intersections: Stability and new proofs, Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions, A generalization of a theorem of Kruskal, Heawood inequalities, On consistent families of circuits, Some results on Sperner families, On the number of subgraphs of prescribed type of graphs with a given number of edges, A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities, Contributions to the geometry of Hamming spaces, A combinatorial decomposition of simplicial complexes, Gotzmann theorems for exterior algebras and combinatorics, More about shifting techniques, Erdős-Ko-Rado with conditions on the minimum complementary degree, On the trace of finite sets, Erdős-Ko-Rado from Kruskal-Katona, On Kruskal's cascades and counting containments in a set of subsets, The edge inducibility of graphs, Continuous versions of some extremal hypergraph problems. II, Representation of Numbers by Cascades

Cites Work

• Existence theorems for Sperner families