On hypergraphs without two edges intersecting in a given number of vertices

DOI10.1016/0097-3165(84)90008-6zbMath0529.05045OpenAlexW2008680358MaRDI QIDQ787170

Zoltan Fueredi, Peter Frankl

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90008-6

zbMATH Keywords

extremal set theoryintersectionset-systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items

All rationals occur as exponents ⋮ Linear independence, a unifying approach to shadow theorems ⋮ An improved universal bound for \(t\)-intersecting families ⋮ Shadow ratio of hypergraphs with bounded degree ⋮ Shadows and shifting ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Forbidden Intersections ⋮ Invitation to intersection problems for finite sets ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ Specified intersections ⋮ Forbidding just one intersection ⋮ Intersection theorems for vector spaces

Cites Work

• Linear dependencies among subsets of a finite set
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An intersection problem for finite sets
• Intersection theorems for systems of finite sets

This page was built for publication: On hypergraphs without two edges intersecting in a given number of vertices