Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fundamental groups of random clique complexes (1312.1208v3)

Published 4 Dec 2013 in math.AT and math.CO

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.

Summary

We haven't generated a summary for this paper yet.