paper

-homology and planar graphs

arXiv:1110.1102

Abstract

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

7 pages