Geodesic
Erdös-Ko-Rado from intersecting shadows
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 379-382

Voir la notice de l'article provenant de la source Library of Science

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős-Ko-Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corresponding results.
Keywords: Kneser graph, coclique, intersecting family, shadow 
@article{DMGT_2012_32_2_a15,
     author = {Katona, Gyula and Kisv\"olcsey, \'Akos},
     title = {Erd\"os-Ko-Rado from intersecting shadows},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {379--382},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a15/}
}
TY  - JOUR
AU  - Katona, Gyula
AU  - Kisvölcsey, Ákos
TI  - Erdös-Ko-Rado from intersecting shadows
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 379
EP  - 382
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a15/
LA  - en
ID  - DMGT_2012_32_2_a15
ER  - 
%0 Journal Article
%A Katona, Gyula
%A Kisvölcsey, Ákos
%T Erdös-Ko-Rado from intersecting shadows
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 379-382
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a15/
%G en
%F DMGT_2012_32_2_a15
Katona, Gyula; Kisvölcsey, Ákos. Erdös-Ko-Rado from intersecting shadows. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 379-382. http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a15/