Klaus Wagner

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Klaus Wagner (right) and Frank Harary at Oberwolfach, 1972

Klaus Wagner (March 31, 1910 – February 6, 2000) was a German mathematician. He studied topology at the University of Cologne under the supervision of Karl Dörge, who had been a student of Issai Schur. Wagner received his Ph.D. in 1937, and taught at Cologne for many years himself.[1] In 1970, he moved to the University of Duisburg, where he remained until his retirement in 1978.

Wagner was honored in 1990 by a festschrift on graph theory,[2] and in June 2000, following Wagner's death, the University of Cologne hosted a Festkolloquium in his memory.[3]

Graph minors[edit]

The Wagner graph, an eight-vertex Möbius ladder arising in Wagner's characterization of K5-free graphs.

Wagner is known for his contributions to graph theory and particularly the theory of graph minors, graphs that can be formed from a larger graph by contracting and removing edges.

Wagner's theorem characterizes the planar graphs as exactly those graphs that do not have as a minor either a complete graph K5 on five vertices or a complete bipartite graph K3,3 with three vertices on each side of its bipartition. That is, these two graphs are the only minor-minimal non-planar graphs. It is closely related to, but should be distinguished from, Kuratowski's theorem, which states that the planar graphs are exactly those graphs that do not contain as a subgraph a subdivision of K5 or K3,3.

Another result of his, also known as Wagner's theorem, is that a four-connected graph is planar if and only if it has no K5 minor. This implies a characterization of the graphs with no K5 minor as being constructed from planar graphs and Wagner graph (an eight-vertex Möbius ladder) by clique-sums, operations that glue together subgraphs at cliques of up to three vertices and then possibly remove edges from those cliques. This characterization was used by Wagner to show that the case k = 5 of the Hadwiger conjecture on the chromatic number of Kk-minor-free graphs is equivalent to the four color theorem. Analogous characterizations of other families of graphs in terms of the summands of their clique-sum decompositions have since become standard in graph minor theory.

Wagner conjectured in the 1930s (although this conjecture was not published until later)[4] that in any infinite set of graphs, one graph is isomorphic to a minor of another. The truth of this conjecture implies that any family of graphs closed under the operation of taking minors (as planar graphs are) can automatically be characterized by finitely many forbidden minors analogously to Wagner's theorem characterizing the planar graphs. Neil Robertson and Paul Seymour finally published a proof of Wagner's conjecture in 2004 and it is now known as the Robertson–Seymour theorem.[5]

Selected publications[edit]

  • Wagner, K. (1937), "Über eine Eigenschaft der ebenen Komplexe", Mathematische Annalen 114: 570–590, doi:10.1007/BF01594196 .

References[edit]

  1. ^ Klaus Wagner at the Mathematics Genealogy Project
  2. ^ Bodendieck, Rainer, ed. (1990), Contemporary Methods in Graph Theory: In honour of Prof. Dr. Klaus Wagner, Mannheim: Bibliographisches Institut, Wissenschaftsverlag, ISBN 978-3-411-14301-6 .
  3. ^ Conference announcement.
  4. ^ Casselman, Bill, Variations on Graph Minor, American Mathematical Society .
  5. ^ Robertson, Neil; Seymour, Paul (2004), "Graph Minors XX: Wagner's Conjecture", Journal of Combinatorial Theory, Series B 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001 .