- Tytuł:
- Erdös-Ko-Rado from intersecting shadows
- Autorzy:
-
Katona, Gyula
Kisvölcsey, Ákos - Powiązania:
- https://bibliotekanauki.pl/articles/743244.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Kneser graph
coclique
intersecting family
shadow - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 379-382
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł