On set intersections

DOI10.1016/0097-3165(80)90063-1zbMath0432.05002OpenAlexW2061684553MaRDI QIDQ1138551

László Babai

Publication date: 1980

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(80)90063-1

zbMATH Keywords

maximum cardinality(n,k,L)-systemfamily of k-subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (10)

A tale of stars and cliques ⋮ Ranks of matrices with few distinct entries ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ A finite set intersection theorem ⋮ Intersection theorems with geometric consequences ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Families of finite sets with three intersections ⋮ On finite set-systems whose every intersection is a kernel of a star ⋮ Set systems with three intersections

Cites Work

• On t-designs
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Intersection Properties of Systems of Finite Sets

This page was built for publication: On set intersections