Biography:György Hajós
György Hajós | |
|---|---|
 György Hajós | |
| Born | 21 February 1912 |
| Died | 17 March 1972 Budapest, Hungary |
| Nationality | Hungarian |
| Citizenship | Hungarian |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Budapest, Budapest Technical University of Budapest, Budapest |
György Hajós (February 21, 1912, Budapest – March 17, 1972, Budapest) was a Hungarian mathematician who worked in group theory, graph theory, and geometry.[1][2]
Biography
Hajós was born February 21, 1912, in Budapest; his great-grandfather, Adam Clark, was the famous Scottish engineer who built the Chain Bridge in Budapest. He earned a teaching degree from the University of Budapest in 1935. He then took a position at the Technical University of Budapest, where he stayed from 1935 to 1949. While at the Technical University of Budapest, he earned a doctorate in 1938. He became a professor at the Eötvös Loránd University in 1949 and remained there until his death in 1972. Additionally he was president of the János Bolyai Mathematical Society from 1963 to 1972.[1][2]
Research
Hajós's theorem is named after Hajós, and concerns factorizations of Abelian groups into Cartesian products of subsets of their elements.[3] This result in group theory has consequences also in geometry: Hajós used it to prove a conjecture of Hermann Minkowski that, if a Euclidean space of any dimension is tiled by hypercubes whose positions form a lattice, then some pair of hypercubes must meet face-to-face. Hajós used similar group-theoretic methods to attack Keller's conjecture on whether cube tilings (without the lattice constraint) must have pairs of cubes that meet face to face; his work formed an important step in the eventual disproof of this conjecture.[4]
Hajós's conjecture is a conjecture made by Hajós that every graph with chromatic number k contains a subdivision of a complete graph Kk. However, it is now known to be false: in 1979, Paul A. Catlin found a counterexample for k = 8,[5] and Paul Erdős and Siemion Fajtlowicz later observed that it fails badly for random graphs.[6] The Hajós construction is a general method for constructing graphs with a given chromatic number, also due to Hajós.[7]
Awards and honors
Hajós was a member of the Hungarian Academy of Sciences, first as a corresponding member beginning in 1948 and then as a full member in 1958. In 1965 he was elected to the Romanian Academy of Sciences, and in 1967 to the German Academy of Sciences Leopoldina. He won the Gyula König Prize in 1942, and the Kossuth Prize in 1951 and again in 1962.[1][2]
References
- ↑ 1.0 1.1 1.2 György Hajós in the Hungarian Biographical Lexicon (Ágnes Kenyeres. Magyar Életrajzi Lexikon. Budapest: Akadémiai Kiadó, 1994. 9789630524971), freely available on www.mek.iif.hu
- ↑ 2.0 2.1 2.2 Horváth, János (2006), "Hajós György", A Panorama of Hungarian Mathematics in the Twentieth Century, Bolyai Society mathematical studies, 14, Springer, p. 606, ISBN 978-3-540-28945-6, https://books.google.com/books?id=EWm4WzSaG3IC&pg=PA606.
- ↑ Hajós, G. (1941), "Über einfache und mehrfache Bedeckung des 'n'-dimensionalen Raumes mit einem Würfelgitter", Math. Z. 47: 427–467, doi:10.1007/bf01180974.
- ↑ Szabó, Sándor (1993), "Cube tilings as contributions of algebra to geometry", Beiträge zur Algebra und Geometrie 34 (1): 63–75, http://www.emis.de/journals/BAG/vol.34/no.1/b34h1sza.ps.gz.
- ↑ Catlin, P. A. (1979), "Hajós's graph-colouring conjecture: variations and counterexamples", Journal of Combinatorial Theory, Series B 26 (2): 268–274, doi:10.1016/0095-8956(79)90062-5.
- ↑ Erdős, Paul; Fajtlowicz, Siemion (1981), "On the conjecture of Hajós", Combinatorica 1 (2): 141–143, doi:10.1007/BF02579269.
- ↑ Hajós, G. (1961), "Über eine Konstruktion nicht n-färbbarer Graphen", Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10: 116–117. As cited by Jensen, Tommy R.; Toft, Bjarne (1994), Graph Coloring Problems (2nd ed.), John Wiley and Sons, ISBN 978-0-471-02865-9.
 |  |
