REAL

Erdos-Ko-Rado from intersecting shadows

Katona, Gyula and Kisvölcsey, Ákos (2012) Erdos-Ko-Rado from intersecting shadows. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 32 (2). pp. 379-382. ISSN 1234-3099

[img]
Preview
Text
Erdos-Ko-Rado from intersecting shadows.pdf

Download (165Kb) | Preview

Abstract

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 Erdos-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.

Item Type: Article
Uncontrolled Keywords: Shadow; Kneser graph; Intersecting family; Coclique
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 11 Dec 2013 08:51
Last Modified: 11 Dec 2013 10:16
URI: http://real.mtak.hu/id/eprint/7991

Actions (login required)

View Item View Item