Bounds on pairs of families with restricted intersections

DOI10.1007/s004939970007zbMath0985.05050OpenAlexW2024073594MaRDI QIDQ1977441

Jiří Sgall

Publication date: 14 May 2000

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsrestricted intersectionsFrank-Rödl theorem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Extremal set theory (05D05)

Related Items (8)

Turán numbers of sunflowers ⋮ On a restricted cross-intersection problem ⋮ Extension complexity of low-dimensional polytopes ⋮ Unavoidable hypergraphs ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Uniformly cross intersecting families ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ Specified intersections

This page was built for publication: Bounds on pairs of families with restricted intersections