A new short proof for the Kruskal-Katona theorem
From MaRDI portal
Publication:793731
DOI10.1016/0012-365X(84)90193-6zbMATH Open0539.05006WikidataQ89355068 ScholiaQ89355068MaRDI QIDQ793731FDOQ793731
Authors: Peter Frankl
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (52)
- \(f\)-vectors of pure complexes and pure multicomplexes of rank three
- Shadows and shifting
- Minimising the total number of subsets and supersets
- Extremal problems for finite sets and convex hulls---a survey
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Minimizing the weight of the union-closure of uniform families of sets
- Title not available (Why is that?)
- Analogues of Milner's theorem for families without long chains and of vector spaces
- A product version of the Hilton-Milner-Frankl theorem
- A short proof of a result of Katz and West
- A short proof of Krull's intersection theorem
- The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
- On sums of generating sets in \(\mathbb Z_2^n\)
- Title not available (Why is that?)
- Forbidding just one intersection
- Yet another generalization of the Kruskal-Katona theorem
- An extended Euler-Poincaré theorem
- Multidimensional Kruskal-Katona theorem
- Helly property in finite set systems
- Compressions and isoperimetric inequalities
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- The spider poset is Macaulay
- A generalization of a theorem of Kruskal
- Families of finite sets with minimum shadows
- A short proof of Kahn-Kalai conjecture
- Exact solution of some Turán-type problems
- Old and new applications of Katona's circle
- Extremal families for Kruskal-Katona theorem
- A lower bound on the size of a complex generated by an antichain
- Augmentation of covering arrays of strength two
- The journey of the union-closed sets conjecture
- Title not available (Why is that?)
- Non-trivial \(r\)-wise intersecting families
- A product version of the Hilton-Milner theorem
- On the structure of minimal winning coalitions in simple voting games
- Shadows and intersections: Stability and new proofs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Lower bounds on two-terminal network reliability
- Title not available (Why is that?)
- Practical sequential bounds for approximating two-terminal reliability
- Polytopes determined by hypergraph classes
- Shadows of colored complexes.
- A Kruskal-Katona type result and applications
- On the treewidth of Hanoi graphs
- Best possible bounds on the number of distinct differences in intersecting families
- Cubes and their centers
- On the size of the product of overlapping families
- A simple proof of the Gan-Loh-Sudakov conjecture
- Inequalities for cross-unions of collections of finite sets
- On learning monotone Boolean functions under the uniform distribution
- A combinatorial decomposition of simplicial complexes
- A new proof of the colored Kruskal-Katona theorem
This page was built for publication: A new short proof for the Kruskal-Katona theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793731)