A new short proof for the Kruskal-Katona theorem
Discrete MathematicsPublished 1 February 1984
Péter Frankl
Citations73
SJR quartileQ1
SJR score0.88
SNIP1.18
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A very short proof for the Kruskal-Katona theorem and Lovasz's version of it is given: given xkk-element sets there are at least xk - 1 (k- 1)-element sets which are contained in at least one of the k-sets.
Abstract
We give a very short proof for the Kruskal-Katona theorem and Lovász's version of it: given xk k-element sets there are at least xk − 1 (k − 1)-element sets which are contained in at least one of the k-sets.
Keywords
Mathematics