Fundamental groups of clique complexes of random graphs

DOI10.1112/TLMS/TLV001MaRDI QIDQ5246002zbMATH OpenOpenAlexFDO

Authors Danijela Horak, A. E. Costa, Michael Farber

Publication date 17 April 2015

Published in Transactions of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1312.1208

zbMATH Keywords

random Erdős-Rényi graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80)

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.

Recommendations

• Large random simplicial complexes. II: The fundamental group
• Geometry and topology of random 2-complexes
• The fundamental group of random 2-complexes.
• Topology of random clique complexes
• Freeness of the random fundamental group

Cited in

(15)

• Topology of random clique complexes
• Collapsibility of random clique complexes
• Phase transition in cohomology groups of non-uniform random simplicial complexes
• Random graph products of finite groups are rational duality groups
• Large random simplicial complexes. III: The critical dimension.
• Random Graphs, Retractions and Clique Graphs
• Random Simplicial Complexes
• Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
• Random Simplicial Complexes: Models and Phenomena
• Characteristic dependence of syzygies of random monomial ideals
• Maps on random hypergraphs and random simplicial complexes
• Large random simplicial complexes. II: The fundamental group
• Large random simplicial complexes. I
• Random hypergraphs, random simplicial complexes and their Künneth-type formulae
• One‐sided sharp thresholds for homology of random flag complexes

This page was built for publication: Fundamental groups of clique complexes of random graphs

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