Concepedia

On the Erdős–Ko–Rado theorem and the Bollobás theorem for<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>t</mml:mi></mml:math>-intersecting families

Dong Yeap Kang, Jaehoon Kim, Younjin Kim

European Journal of Combinatorics · 2015 · 11 citations · 8 references

References

8

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Péter L. Erdős, Chao Ko, R. Rado · The Quarterly Journal of Mathematics · 1961 · 1.3K citations

Theory Of Computing, Combinatorics On Word, Engineering +10

On generalized graphs

B. Bollobás · Acta Mathematica Academiae Scientiarum Hungaricae · 1965 · 386 citations

Mathematical Programming, Engineering, Graph Theory +5

An Extremal Problem for two Families of Sets

Péter Frankl · European Journal of Combinatorics · 1982 · 246 citations

Mathematical Programming, Engineering, Combinatorial Problem +5

The exact bound in the Erdös-Ko-Rado theorem

Richard M. Wilson · COMBINATORICA · 1984 · 245 citations

Lower Bound, Extremal Set Theory, Extremal Combinatorics +2

On Sperner families satisfying an additional condition

Péter Frankl · Journal of Combinatorial Theory Series A · 1976 · 93 citations

Sperner Families, Algebraic Combinatorics, Combinatorial Design +1