Families of finite sets with minimum shadows

DOI10.1007/BF02579261zbMath0641.05002OpenAlexW1972612624MaRDI QIDQ1100465

Jerrold R. Griggs, Zoltan Fueredi

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579261

zbMATH Keywords

subsetsextremal families

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (16)

A problem of Shapozenko on Johnson graphs ⋮ Minimum shadows in uniform hypergraphs and a generalization of the Takagi function ⋮ Gotzmann theorems for exterior algebras and combinatorics ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ Gotzmann squarefree ideals ⋮ Many Cliques in Bounded-Degree Hypergraphs ⋮ Stability for vertex isoperimetry in the cube ⋮ On the orthogonal product of simplices and direct products of truncated Boolean lattices ⋮ A combinatorial proof of Gotzmann's persistence theorem for monomial ideals ⋮ Diversity ⋮ A size-sensitive inequality for cross-intersecting families ⋮ Erdős-Ko-Rado with conditions on the minimum complementary degree ⋮ Unnamed Item ⋮ When are stars the largest cross-intersecting families? ⋮ Uniqueness in Harper's vertex-isoperimetric theorem ⋮ On the size of the product of overlapping families

Cites Work

• Unnamed Item
• A new short proof for the Kruskal-Katona theorem
• A generalization of a theorem of Kruskal
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Families of finite sets with minimum shadows