Geodesic
Collapsibility of simplicial complexes of hypergraphs
Alan Lew1
1Technion
The electronic journal of combinatorics, Tome 26 (2019) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $\mathcal{H}$ be an $r$-uniform hypergraph. We show that the simplicial complex whose simplices are the hypergraphs $\mathcal{F}\subset\mathcal{H}$ with covering number at most $p$ is $\left(\binom{r+p}{r}-1\right)$-collapsible. Similarly, the simplicial complex whose simplices are the pairwise intersecting hypergraphs $\mathcal{F}\subset\mathcal{H}$ is $\frac{1}{2}\binom{2r}{r}$-collapsible.
DOI : 10.37236/8364
Classification : 05E45, 05D05, 05C65
Mots-clés : \(r\)-uniform hypergraph

Alan Lew  1

1 Technion 
@article{10_37236_8364,
     author = {Alan Lew},
     title = {Collapsibility of simplicial complexes of hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {4},
     doi = {10.37236/8364},
     zbl = {1422.05109},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/8364/}
}
TY  - JOUR
AU  - Alan Lew
TI  - Collapsibility of simplicial complexes of hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8364/
DO  - 10.37236/8364
ID  - 10_37236_8364
ER  - 
%0 Journal Article
%A Alan Lew
%T Collapsibility of simplicial complexes of hypergraphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/8364/
%R 10.37236/8364
%F 10_37236_8364
Alan Lew. Collapsibility of simplicial complexes of hypergraphs. The electronic journal of combinatorics, Tome 26 (2019) no. 4. doi: 10.37236/8364

Cité par Sources :