Shadows and shifting

DOI10.1007/BF01789460zbMath0759.05094OpenAlexW1992531333MaRDI QIDQ1175547

Peter Frankl

Publication date: 25 June 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

shadowsshiftingpolygonal line path

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items

Rainbow version of the Erdős Matching Conjecture via concentration, The Erdős matching conjecture and concentration inequalities, Cross-intersecting pairs of hypergraphs, Unnamed Item, On the structure of minimal winning coalitions in simple voting games, On Mubayi's Conjecture and Conditionally Intersecting Sets, Minimum degree and diversity in intersecting antichains, Invitation to intersection problems for finite sets, Tight bounds for Katona's shadow intersection theorem, On strengthenings of the intersecting shadow theorem

Cites Work

• Unnamed Item
• On hypergraphs without two edges intersecting in a given number of vertices
• A new short proof for the Kruskal-Katona theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Generalizations of theorems of Katona and Milner
• Intersection theorems for systems of finite sets