Intersection Theorems for Finite Sets and Geometric Applications

@inproceedings{Frankl2010IntersectionTF,
  title={Intersection Theorems for Finite Sets and Geometric Applications},
  author={Peter Frankl},
  year={2010}
}
1. Introduction. Let X be an n-element set and F C 2 X a family of distinct subsets of X. Suppose that the members of F satisfy some conditions. What is the maximum (or minimum) value of |F|—this is the generic problem in extremal set theory. There have been far too many papers and results in this area to be overviewed in such a short paper. Therefore, we will only deal with some intersection theorems. The simplest is 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Old and new euclidean Ramsey theorems, Discrete Geometry and Convexity, Ann

R. L. Graham
New York Acad. Sci., • 1985

Characterization of f -vectors of families of convex sets in R, Israel

G. Kalai
J. Math • 1984

Thesis

N. Alon, Ph.D
Hebrew University, • 1983
View 1 Excerpt

Erdös-Ko-Rado type theorems with upper bounds on the maximum degree

Fül Z. Füredi
Colloq. Math. Soc. Jânos Bolyai • 1981

Similar Papers

Loading similar papers…