Journal of Geometry · 2011 · 22 citations · 50 references
Natural SciencesMathematicsCombinatoricsGeometrySet TheoryCombinatorial Set TheoryConvex GeometryChromatic PolynomialsExtremal Set TheoryKneser GraphsKneser's TheoremKneser’s TheoremStability Theorems
In this survey recent results about q -analogues of some classical theorems in extremal set theory are collected. They are related to determining the chromatic number of the q -analogues of Kneser graphs. For the proof one needs results on the number of 0-secant subspaces of point sets, so in the second part of the paper recent results on the structure of point sets having few 0-secant subspaces are discussed. Our attention is focussed on the planar case, where various stability results are given.
50
On an extremal problem in graph theory
Péter L. Erdős · Colloquium Mathematicum · 1964 · 676 citations · Full text
Intersection Theorems for Systems of Sets
P. Erdös, R. Rado · Journal of the London Mathematical Society · 1960 · 638 citations