Connectivity of ample, conic and random simplicial complexes

DOI10.1093/IMRN/RNAC030MaRDI QIDQ6362259arXivFDO

Authors Jonathan Ariel Barmak

Publication date 5 March 2021

Published in arXiv

Full work available at URL https://doi.org/10.1093/IMRN/RNAC030

Mathematics Subject Classification ID

Connectivity (05C40) Combinatorial aspects of simplicial complexes (05E45)

arXiv classification

math.ATmath.CO

Abstract: A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic complex need not be $n$-connected but a $6^n$-conic complex is $n$-connected. This extends results by Even-Zohar, Farber and Mead on ample complexes and answers two questions raised in their paper. Our results together with theirs imply that the probability of a complex being $n$-connected tends to $1$ as the number of vertices tends to $infty$. Our model here is the medial regime.

This page was built for publication: Connectivity of ample, conic and random simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6362259)