Herbert Fleischner

from Wikipedia, the free encyclopedia
Herbert Fleischner, 2017

Herbert Fleischner (born January 29, 1944 in London ) is an Austrian mathematician .

Life

Fleischner has lived in Vienna since 1946 , where he attended the BRG I Stubenbastei and studied mathematics at the University of Vienna from 1962 to 1968 with Professors Nikolaus Hofreiter and Edmund Hlawka . He received his doctorate in 1968 from Hlawka on the subject of theorems about Euler's graphs with special properties, theorems about the existence of Hamiltonian lines . Herbert Izbicki actually supervised his dissertation . From 1973 to 2002 he was at the Austrian Academy of Sciences with interruptions through stays abroad(ÖAW). His numerous guest residencies include SUNY Binghamton (1970–1972), Institute for Advanced Study (Princeton, 1972–1973, NSF Grant), Memphis State University (now Memphis University, 1977), MIT (1978, Max Kade Scholarship), University of Zimbabwe (Academic Staff Development Project sponsored by Austrian Development Cooperation and UNESCO, 1997–1999), West Virginia University (2002) and Texas A&M University (summer semester 2003 and summer semester 2006).

Fleischner researches mainly in the area of graph theory on Hamiltonian and Eulerian graphs. Its main result is the proof of the theorem: The square of a doubly connected graph has a Hamiltonian line . He proved this theorem, which was named after him as Fleischner's theorem , in an article submitted in 1971 and published in 1974.

Another milestone in his research is the solution of the “Cycle plus Triangles Problem” by Paul Erdős together with Michael Stiebitz .

Fleischner published more than 90 publications in scientific journals. His Erdős number is 2. His friendship with the painter Robert Lettner led to a cooperation that resulted in a comparison of mathematical and painterly results.

From 2002 to 2007 he was Chairman of the Committee for Developing Countries of the European Mathematical Society (EMS-CDC).

Fonts

  • Eulerian Graphs and Related Topics: Part 1, Volume 1 (= Annals of Discrete Mathematics Volume 45). Elsevier, July 1990, ISBN 978-0-444-88395-7 .
  • Eulerian Graphs and Related Topics: Part 1, Volume 2 (= Annals of Discrete Mathematics Volume 50). Elsevier, June 1991, ISBN 978-0-444-89110-5 .

Web links

Individual evidence

  1. West Virginia University, WVUTODAY ARCHIVE
  2. ^ Herbert Fleischner: The square of every two-connected graph is Hamiltonian. In: Journal of Combinatorial Theory, Series B. 16 (1974): 29-34.
  3. H. Fleischner, M. Stiebitz: A solution to a coloring problem of P. Erdős. Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's "The theory of regular graphs". Discrete Mathematics. Volume 101 (1992) No. 1-3, May 29, pp. 39-48.