Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Erdös-Ko-Rado from intersecting shadows

Gyula O.H. KatonaÁkos Kisvölcsey — 2012

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)