Families of finite sets with prescribed cardinalities for pairwise intersections

DOI10.1007/BF01886305zbMath0475.05064MaRDI QIDQ3931437

Peter Frankl

Publication date: 1980

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

zbMATH Keywords

extremal familiesn,k,L-system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (10)

Maximum trees of finite sequences ⋮ Ranks of matrices with few distinct entries ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ An intersection problem whose extremum is the finite projective space ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ 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

• Unnamed Item
• A note on the realization of distances within sets in euclidean space
• Intersection Theorems for Systems of Sets
• On families of finite sets no two of which intersect in a singleton

This page was built for publication: Families of finite sets with prescribed cardinalities for pairwise intersections