A generalization of a theorem of Kruskal
From MaRDI portal
Publication:1073037
DOI10.1007/BF02582941zbMath0588.05014MaRDI QIDQ1073037
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items
A problem of Shapozenko on Johnson graphs, Union of shadows, Minimum shadows in uniform hypergraphs and a generalization of the Takagi function, Families of finite sets with minimum shadows, Erdős-Ko-Rado theorem with conditions on the maximal degree, A generalization of the Katona theorem for cross t-intersecting families, A simple proof of the Hilton-Milner theorem, A product version of the Hilton-Milner theorem, Uniform intersecting families with large covering number, A note on the maximum product-size of non-trivial cross \(t\)-intersecting families, Improved bounds on the maximum diversity of intersecting families, Stability for vertex isoperimetry in the cube, Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, On the orthogonal product of simplices and direct products of truncated Boolean lattices, Sharp results concerning disjoint cross-intersecting families, Some best possible inequalities concerning cross-intersecting families, A size-sensitive inequality for cross-intersecting families, Unnamed Item, When are stars the largest cross-intersecting families?
Cites Work
- Unnamed Item
- A new short proof for the Kruskal-Katona theorem
- Non-trivial intersecting families
- A simple proof of the Kruskal-Katona theorem
- Erdős-Ko-Rado from Kruskal-Katona
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Combinatorial Problem in the k-Adic Number System
- On a conjecture of milner on k-graphs with non-disjoint edges
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A generalization of a combinatorial theorem of macaulay
