English

$\ell^2$-homology and planar graphs

Geometric Topology 2011-10-07 v1

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 K5K_5, the complete graph on 5 vertices, or K3,3K_{3,3}, the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that the K3,3K_{3,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\ell^2-homology. In this paper, we employ a similar method proving K5K_5 is not planar.

Keywords

Cite

@article{arxiv.1110.1102,
  title  = {$\ell^2$-homology and planar graphs},
  author = {Timothy A. Schroeder},
  journal= {arXiv preprint arXiv:1110.1102},
  year   = {2011}
}

Comments

7 pages

R2 v1 2026-06-21T19:15:45.691Z