^2-homology and planar graphs

From MaRDI portal
Publication:2839283



Abstract: In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph Gamma is planar if and only if it does not contain a subgraph that is homeomorphic to K5, the complete graph on 5 vertices, or K3,3, the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that the K3,3 graph can be understood as the nerve of a right-angled Coxeter system and prove that this graph is not planar using results from ell2-homology. In this paper, we employ a similar method proving K5 is not planar.












This page was built for publication: \(\ell ^{2}\)-homology and planar graphs

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