Connectivity of ample, conic and random simplicial complexes
Algebraic Topology
2021-03-09 v1 Combinatorics
Abstract
A simplicial complex is -conic if every subcomplex of at most vertices is contained in the star of a vertex. A -conic complex is simply connected. We prove that an -conic complex is -connected. In general a -conic complex need not be -connected but a -conic complex is -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 -connected tends to as the number of vertices tends to . Our model here is the medial regime.
Cite
@article{arxiv.2103.03952,
title = {Connectivity of ample, conic and random simplicial complexes},
author = {Jonathan A. Barmak},
journal= {arXiv preprint arXiv:2103.03952},
year = {2021}
}
Comments
14 pages, many figures