A new short proof for the Kruskal-Katona theorem
From MaRDI portal
Publication:793731
DOI10.1016/0012-365X(84)90193-6zbMath0539.05006WikidataQ89355068 ScholiaQ89355068MaRDI QIDQ793731
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A combinatorial decomposition of simplicial complexes, On Sums of Generating Sets in ℤ2n, Practical sequential bounds for approximating two-terminal reliability, Families of finite sets with minimum shadows, Extremal problems for finite sets and convex hulls---a survey, The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem, Erdős-Ko-Rado theorem with conditions on the maximal degree, Exact solution of some Turán-type problems, Lower bounds on two-terminal network reliability, An extended Euler-Poincaré theorem, A lower bound on the size of a complex generated by an antichain, \(f\)-vectors of pure complexes and pure multicomplexes of rank three, Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem, The journey of the union-closed sets conjecture, Augmentation of covering arrays of strength two, A product version of the Hilton-Milner theorem, A product version of the Hilton-Milner-Frankl theorem, Non-trivial \(r\)-wise intersecting families, Minimising the total number of subsets and supersets, Shadows and shifting, Analogues of Milner's theorem for families without long chains and of vector spaces, Shadows and intersections: Stability and new proofs, The spider poset is Macaulay, Cubes and their centers, Helly property in finite set systems, Unnamed Item, On the structure of minimal winning coalitions in simple voting games, Inequalities for cross-unions of collections of finite sets, Old and new applications of Katona's circle, On the treewidth of Hanoi graphs, Best possible bounds on the number of distinct differences in intersecting families, On the size of the product of overlapping families, A simple proof of the Gan-Loh-Sudakov conjecture, Forbidding just one intersection, Compressions and isoperimetric inequalities, The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families, A generalization of a theorem of Kruskal, Polytopes determined by hypergraph classes, On learning monotone Boolean functions under the uniform distribution
Cites Work
