Erdős-Ko-Rado type theorems for simplicial complexes
The electronic journal of combinatorics, Tome 24 (2017) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is shown that every shifted simplicial complex $\Delta$ is EKR of type $(r,s)$, provided that the size of every facet of $\Delta$ is at least $(2s+1)r-s$. It is moreover proven that every $i$-near-cone simplicial complex is EKR of type $(r,i)$ if ${\rm depth}_{\mathbb{K}}\Delta\geq (2i+1)r-i-1$, for some field $\mathbb{K}$. Furthermore, we prove that if $G$ is a graph having at least $(2i+1)r-i$ connected components, including $i$ isolated vertices, then its independence simplicial complex $\Delta_G$ is EKR of type $(r,i)$. The results of this paper, generalize the main result of Frankl (2013).
DOI : 10.37236/6544
Classification : 05E45, 05D05, 05C70
Mots-clés : Erdős-Ko-Rado theorem, simplicial complex, matching number, algebraic shifting, \(i\)-near-cone

Seyed Amin Seyed Fakhari  1

1 University of Tehran
@article{10_37236_6544,
     author = {Seyed Amin Seyed Fakhari},
     title = {Erd\H{o}s-Ko-Rado type theorems for simplicial complexes},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {2},
     doi = {10.37236/6544},
     zbl = {1366.05126},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6544/}
}
TY  - JOUR
AU  - Seyed Amin Seyed Fakhari
TI  - Erdős-Ko-Rado type theorems for simplicial complexes
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6544/
DO  - 10.37236/6544
ID  - 10_37236_6544
ER  - 
%0 Journal Article
%A Seyed Amin Seyed Fakhari
%T Erdős-Ko-Rado type theorems for simplicial complexes
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/6544/
%R 10.37236/6544
%F 10_37236_6544
Seyed Amin Seyed Fakhari. Erdős-Ko-Rado type theorems for simplicial complexes. The electronic journal of combinatorics, Tome 24 (2017) no. 2. doi: 10.37236/6544

Cité par Sources :