Fundamental Groups of Random Clique Complexes

arXiv1207.5028MaRDI QIDQ6234541FDOQ6234541

Authors: Eric Babson 

Publication date: 20 July 2012

Abstract: Clique complexes of ErdH{o}s-R'{e}nyi random graphs with edge probability between $n^{-1over3}$ and $n^{-1over2}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex for which every subcomplex has fewer than three times as many edges as vertices must have the homotopy type of a wedge of circles, two spheres and real projective planes. Note that $n^{-1over3}$ is a threshold for simple connectivity and $n^{-1over2}$ is one for vanishing first $F_2$ homology.

This page was built for publication: Fundamental Groups of Random Clique Complexes

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