Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Gerhard Ringel

Modern

Gerhard Ringel (28 October 1919 in Kollnbrunn, Austria to 24 June 2008 in Santa Cruz, California) was a German mathematician and one of the pioneers in graph theory. He contributed significantly to the proof of the Heawood conjecture, now the Ringel-Youngs theorem, a problem closely linked with the four color theorem. Although born in Austria, he was raised in Czechoslovakia and attended Charles University before being drafted into the Wehrmacht in 1940, and after the war he served for over four years in a Soviet prisoner of war camp. He earned his doctorate at the University of Bonn in 1951 under Emanuel Sperner and Ernst Peschl, began his academic career as a professor at the Free University Berlin, and in 1970 left Germany for the University of California, Santa Cruz.

Facts
Biography
Gender
Male 1
Connections

Conjectures Posed

Source Graceful Labeling (Wikipedia)

In Branch

Source Wikipedia: Gerhard Ringel

Proofs Credited

Source Heawood conjecture (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: Gerhard Ringel
Lead
Quote, Lead
He was one of the pioneers in graph theory and contributed significantly to the proof of the Heawood conjecture (now the Ringel-Youngs theorem), a mathematical problem closely linked with the four color theorem.
View the Source
Heawood conjecture (Wikipedia)
Proofs Credited: Ringel-Youngs Theorem, Lead
Quote, Proofs Credited: Ringel-Youngs Theorem, Lead
The conjecture was formulated in 1890 by P.J. Heawood and proven in 1968 by Gerhard Ringel and J.W.T. Youngs.
View the Source
Graceful Labeling (Wikipedia)
Conjectures Posed: Ringel-Kotzig Conjecture, Lead
Quote, Conjectures Posed: Ringel-Kotzig Conjecture, Lead
A major open problem in graph theory is the graceful tree conjecture or Ringel-Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, and sometimes abbreviated GTC (not to be confused with Kotzig's conjecture on regularly path connected graphs)
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.