András Hajnal

from Wikipedia, the free encyclopedia

András Hajnal (born May 13, 1931 in Hungary ; † July 30, 2016 ) was a Hungarian mathematician.

Hajnal studied mathematics at the Eötvös Loránd University in Budapest , where he received his diploma in 1953. He received his doctorate in 1957 under László Kalmár (candidate title) and habilitated in 1962 (doctorate). From 1956 he taught at the Eötvös Loránd University. In 1994 he went to Rutgers University in the USA , where he retired in 2004. There he was director of DIMACS (Center for Discrete Mathematics and Theoretical Computer Science).

Hajnal dealt with set theory and combinatorics. He worked closely with Paul Erdős , with whom he published 56 papers. He and his student Endre Szemerédi wrote the Hajnal-Szemeredi theorem about graph coloration (1970), originally assumed by Erdős. It says that for graphs with maximum node degree k there is as uniform a coloring as possible with k + 1 colors. A sentence in axiomatic set theory about a partition function is named after him and James Baumgartner .

Hajnal had been a member of the Hungarian Academy of Sciences since 1982 and headed its Mathematics Institute from 1982 to 1992. From 1980 to 1990 he was secretary of the Mathematical Society Janos Bolyai and from 1990 to 1996 its president. In 1974 he was invited speaker at the International Congress of Mathematicians in Vancouver (Results and independence results in set theoretical topology). He was a fellow of the American Mathematical Society .

Hajnal was a passionate chess player.

Fonts

  • with Hamburger: Set Theory, London Mathematical Society Student Texts, Cambridge University Press 1999
  • with Paul Erdős, Attila Máté, Richard Rado: Combinatorial set theory: partition relations for cardinals, North-Holland, 1984, Studies in Logic and the Foundations of Mathematics Vol. 106.
  • Editor with Béla Bollobás , Alan Baker : A tribute to Paul Erdös, Cambridge University Press 1990

Web links

Individual evidence

  1. Az MTA köztestületének tagjai
  2. neighboring nodes have different colors. The number of nodes for each color differs by a maximum of 1
  3. ^ Hajnal, Szemeredi Proof of a conjecture of Erdös , in Erdös, Renyi, Vera Sos (editor) Combinatorial theory and its applications , Vol. 2, North Holland 1970, pp. 601-623