Intersecting families in a subset of Boolean lattices
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $n, r$ and $\ell$ be distinct positive integers with $r < \ell\leq n/2$, and let $X_1$ and $X_2$ be two disjoint sets with the same size $n$. Define $$\mathcal{F}=\left\{A\in \binom{X}{r+\ell}: \mbox{$|A\cap X_1|=r$ or $\ell$}\right\},$$ where $X=X_1\cup X_2$. In this paper, we prove that if $\mathcal{S}$ is an intersecting family in $\mathcal{F}$, then $|\mathcal{S}|\leq \binom{n-1}{r-1}\binom{n}{\ell}+\binom{n-1}{\ell-1}\binom{n}{r}$, and equality holds if and only if $\mathcal{S}=\{A\in\mathcal{F}: a\in A\}$ for some $a\in X$.
DOI : 10.37236/724
Classification : 05D05, 06A07
Mots-clés : intersecting family, graded posets, Erdös-Ko-Rado theorem
@article{10_37236_724,
     author = {Jun Wang and Huajun Zhang},
     title = {Intersecting families in a subset of {Boolean} lattices},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/724},
     zbl = {1244.05224},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/724/}
}
TY  - JOUR
AU  - Jun Wang
AU  - Huajun Zhang
TI  - Intersecting families in a subset of Boolean lattices
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/724/
DO  - 10.37236/724
ID  - 10_37236_724
ER  - 
%0 Journal Article
%A Jun Wang
%A Huajun Zhang
%T Intersecting families in a subset of Boolean lattices
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/724/
%R 10.37236/724
%F 10_37236_724
Jun Wang; Huajun Zhang. Intersecting families in a subset of Boolean lattices. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/724

Cité par Sources :