Repository logo
Article

A general 2-part Erdȍs-Ko-Rado theorem

Loading...
Thumbnail Image

Date

Presentation Date

Editor

Other contributors

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)

Other title

Resource type

Version

wersja wydawnicza
Item type:Journal Issue,
Opuscula Mathematica
2017 - Vol. 37 - No. 4

Pagination/Pages:

pp. 577-588

Research Project

Event

Description

Bibliogr. 588.

Abstract

A two-part extension of the famous Erdȍs-Ko-Rado Theorem is proved. The underlying set is partitioned into $X_1$ and $X_2$. Some positive integers $k_i$, $\ell_i$ ($1\leq i\leq m$) are given. We prove that if $\mathcal{F}$) is an intersecting family containing members $F$ such that $|F\cap X_1|=k_i$, $|F\cap X_2|=\ell_i$ holds for one of the values $i$ ($1\leq i\leq m$) then $|\mathcal{F}|$ cannot exceed the size of the largest subfamily containing one element.

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)