2000 character limit reached
Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
Published 27 Apr 2010 in math.CO, math.GR, and math.GT | (1004.4719v5)
Abstract: In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the 1-skeleton of some simplicial flag complex $L$ which is a homology manifold of dimension $n \ge 1$, then the graph $\Gamma$ is reconstructible.
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.