Kuratowski's theorem

Kuratowski's theorem
Name	Kuratowski's theorem
Field	Topology; Graph theory
Person	Kazimierz Kuratowski
Year	1930
Statement	Characterizes planar graphs by forbidden subdivisions

Kuratowski's theorem is a classical result in graph theory and topology that gives a structural characterization of planar graphs via forbidden subdivisions of two nonplanar graphs. Formulated by Kazimierz Kuratowski in 1930, the theorem connects combinatorial properties of graphs with the topological notion of embedding on the sphere and has influenced work by figures and institutions such as Paul Erdős, Kőnig, John von Neumann, Stanford University, and the American Mathematical Society.

Statement

Kuratowski's theorem states that a finite graph is planar if and only if it contains no subdivision of either K5 or K3,3 as a subgraph, where Kazimierz Kuratowski first identified these obstructions in a paper influenced by contemporaries at Jagiellonian University, correspondents such as Wacław Sierpiński, and subsequent expositors like Marshall Hall Jr. and Oswald Veblen. The theorem is equivalent to earlier work in topology on embeddings in the sphere and was developed parallel to investigations at institutions including University of Warsaw, Princeton University, and University of Cambridge.

Background and definitions

Key terms include graph, planar graph, subdivision, topological equivalence, vertex, and edge. Kuratowski's approach used notions from point-set topology and combinatorial graph theory developed by researchers such as Arthur Cayley, Tait, Kőnig, and Dénes Kőnig. The forbidden graphs K5 and K3,3 were studied in classical combinatorial investigations by Pólya, Cauchy, and later by Hassler Whitney and William Tutte. Contextual concepts include embeddings on the plane, the sphere, and surfaces studied by Bernhard Riemann, Henri Poincaré, and modern work at Princeton Institute for Advanced Study.

Proof outline

Proofs of Kuratowski's theorem have been given by many mathematicians, including expositions by Kazimierz Kuratowski himself, simplifications by Kuratowski (1930), later treatments by Hassler Whitney, and algorithmic proofs developed at MIT and Bell Labs. The standard proof proceeds by contradiction: assume a minimal nonplanar graph and analyze connectivity, using operations such as edge deletion and vertex splitting attributed to methods of G.H. Hardy, John Conway, and W.T. Tutte. One shows that a minimal counterexample must be 2-connected, then 3-connected after ear decompositions associated with work by Bernard Bollobás and Nash-Williams, and finally exhibits a subdivision of K5 or K3,3 using Kuratowski's reduction lemmas that echo techniques from Menger's theorem and Gabriel Andrew Dirac-type connectivity analyses.

Consequences and corollaries

Kuratowski's theorem implies Wagner's theorem, an equivalent characterization via graph minors developed by Klaus Wagner and elaborated through the Robertson–Seymour theorem by Neil Robertson and Paul Seymour at institutions like Bellcore and University of Waterloo. It yields corollaries about planar embeddings used in results by Fáry's theorem and by Steinitz in polyhedral combinatorics, relating planar 3-connected graphs to convex polyhedra studied by Branko Grünbaum and G. H. Hardy analogues. Consequences include bounds from Euler's formula employed by Leonhard Euler and combinatorial inequalities used in work by Paul Erdős and Alfréd Rényi in random graph theory at places such as Mathematical Institute of the Polish Academy of Sciences.

Algorithms and applications

Kuratowski's theorem underpins planarity testing algorithms developed by John Hopcroft and Robert Tarjan and later improvements by Shimon Even and Michael Hopcroft; practical planarity testers are used in software from companies and labs like Bell Labs and research groups at IBM Research and AT&T Bell Laboratories. Applications include graph drawing studied by Emden R. Gansner and Yifan Hu, circuit layout problems at Intel Corporation and IBM, geographic information systems at ESRI, and computational topology work at Institute for Computational and Experimental Research in Mathematics. Algorithmic corollaries include linear-time planarity testing, planar embedding extraction, and certification by exhibiting a Kuratowski subdivision, building on algorithmic graph minor theory from the Robertson–Seymour project and implementations in libraries such as those from Boost C++ Libraries and CGAL.

Generalizations and related results

Generalizations include characterizations of graphs embeddable on surfaces of higher genus studied by Heawood conjecture work and by W. T. Tutte, extensions via the Graph Minor Theorem (Robertson and Seymour), and forbidden-minor characterizations for orientable and nonorientable surfaces researched at University of Illinois at Urbana–Champaign and University of Toronto. Related results include Wagner's theorem by Klaus Wagner, Whitney's planarity criteria by Hassler Whitney, and extensions in topological graph theory by János Pach, Miklos Simonovits, and scholars at Eötvös Loránd University. Modern research connects Kuratowski's framework to rigidity theory studied by James Clerk Maxwell and G. Laman, to parameterized algorithms by Downey and Fellows, and to structural graph theory pursued by Daniel Spielman and Noga Alon.

Category:Theorems in graph theory