Gerhard Ringel

Gerhard Ringel (October 28, 1919 in Kollnbrunn, Austria – June 24, 2008 in Santa Cruz, California) was a German mathematician. 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.

Gerhard Ringel

Although born in Austria, Ringel was raised in Czechoslovakia and attended Charles University before being drafted into the Wehrmacht in 1940 (after Germany had taken control of much of what had been Czechoslovakia). After the war Ringel served for over four years in a Soviet prisoner of war camp.[1]

He earned his Ph.D. from the University of Bonn in 1951 with a thesis written under the supervision of Emanuel Sperner and Ernst Peschl.[2] Ringel started his academic career as professor at the Free University Berlin. In 1970 he left Germany due to bureaucratic consequences of the German student movement, and continued his career at the University of California, Santa Cruz, having been invited there by his coauthor, John W. T. (Ted) Youngs. He was awarded honorary doctorate degrees from the Karlsruhe Institute of Technology and the Free University of Berlin.

Besides his mathematical skills he was a widely acknowledged entomologist. His main emphasis lay on collecting and breeding butterflies. Prior to his death, he gave his outstanding collection of butterflies to the UCSC Museum of Natural History Collections.[3]

Publications
  • Ringel, Gerhard; Youngs, J.W.T. (1968). "Solution of the Heawood map-coloring problem". Proceedings of the National Academy of Sciences of the United States of America. 60 (2): 438–445. doi:10.1073/pnas.60.2.438. MR 0228378. PMC 225066. PMID 16591648.
  • Ringel, Gerhard (1974). Map Color Theorem. New York-Berlin: Springer-Verlag.[4]
  • Hartsfield, Nora; Ringel, Gerhard (1990). Pearls in graph theory. Boston, MA: Academic Press. ISBN 0-12-328552-6.
gollark: Like how I fear C, and all heavy machinery ever.
gollark: It seems reasonable to fear powerful and highly footgun-y tools.
gollark: You're just assuming something is symmetric because you... have examples of values on both sides?
gollark: Don't do that, it's actually bad.
gollark: (I do not know enough population genetics to say and I'd be handwavily guessing half the parameters anyway)

References
  1. Bodendiek, Rainer; Henn, Rudolf, eds. (1990). Topics in Combinatorics and Graph Theory. Essays in Honour of Gerhard Ringel (PDF). Heidelberg: Physica-Verlag HD. doi:10.1007/978-3-642-46908-4. ISBN 978-3-642-46910-7. MR 1100014.
  2. Gerhard Ringel at the Mathematics Genealogy Project
  3. Retired mathematics professor Gerhard Ringel gives his world-class butterfly collection to UCSC Archived 2012-03-05 at the Wayback Machine, UC Santa Cruz Review, Fall 2006
  4. Kleitman, Daniel (1975). "Review: Map color theorem by Gerhard Ringel" (PDF). Bulletin of the American Mathematical Society. 81 (4): 657–660. doi:10.1090/s0002-9904-1975-13811-0.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.