2000 character limit reached
Fundamental groups of random clique complexes
Published 4 Dec 2013 in math.AT and math.CO | (1312.1208v3)
Abstract: We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random clique complex satisfies the Whitehead conjecture, i.e. all irs subcomplexes are also aspherical.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.