2-homology and planar graphs

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 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 2-homology. In this paper, we employ a similar method proving K5 is not planar.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…