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

DOI10.1016/0097-3165(84)90008-6MaRDI QIDQ787170zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi, 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

intersectionextremal set theoryset-systems

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(14)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787170)