{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:36Z","timestamp":1753893816958,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\mathcal{H}$ be an $r$-uniform hypergraph.\u00a0We 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.<\/jats:p>","DOI":"10.37236\/8364","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T01:04:53Z","timestamp":1578618293000},"source":"Crossref","is-referenced-by-count":1,"title":["Collapsibility of Simplicial Complexes of Hypergraphs"],"prefix":"10.37236","volume":"26","author":[{"given":"Alan","family":"Lew","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2019,10,11]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i4p10\/7935","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i4p10\/7935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:02:44Z","timestamp":1579215764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i4p10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,11]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,10,11]]}},"URL":"https:\/\/doi.org\/10.37236\/8364","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,10,11]]},"article-number":"P4.10"}}