A finite set intersection theorem

DOI10.1016/S0195-6698(81)80003-0zbMATH Open0461.05001MaRDI QIDQ1152365FDOQ1152365

Authors: Peter Frankl, Ivo G. Rosenberg 

Publication date: 1981

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Intersection Theorems for Systems of Sets
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• On set intersections
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On finite set-systems whose every intersection is a kernel of a star
• Intersection theorems with geometric consequences
• A Partition Property of Simplices in Euclidean Space
• Determination of the residue classes of a polynomial at integral arguments
• Sharpness of some intersection theorems
• Erdös–Ko–Rado Theorem—22 Years Later
• Set-systems with prescribed cardinalities for pairwise intersections
• Edge-Ramsey theory
• On Ramsey sets in spheres
• Finite Euclidean Ramsey theory

This page was built for publication: A finite set intersection theorem

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