Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups (Q902247)

Let \(G=(V,E)\) be a graph. It is said to be \textit{reconstructible}, if any graph `locally isomorphic' to \(G\) in a sense described below, is actually isomorphic to \(G\). Here, by a local isomorphism between \(G=(V,E)\), and \(G'=(V',E')\), we mean a bijection \(f: V\to V'\), which induces an isomorphism of complete subgraphs spanned by \(W\) and \(f(W)\), respectively, where \(W\subseteq V\) is a proper subset of vertices. The \textit{reconstruction conjecture} states that every finite graph with at least three vertices is reconstructible. The main theorem of the article establishes the reconstruction conjecture for graphs which are \(1\)-skeleta of simplicial flag complexes which are homology manifolds.