Age, Biography and Wiki
György Hajós was born on 21 February, 1912 in Budapest, Austria-Hungary, is a Hungarian mathematician. Discover György Hajós's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 60 years old?
| Popular As |
N/A |
| Occupation |
N/A |
| Age |
60 years old |
| Zodiac Sign |
Pisces |
| Born |
21 February, 1912 |
| Birthday |
21 February |
| Birthplace |
Budapest, Austria-Hungary |
| Date of death |
1972 |
| Died Place |
Budapest, Hungary |
| Nationality |
Hungary
|
We recommend you to check the complete list of Famous People born on 21 February.
He is a member of famous mathematician with the age 60 years old group.
György Hajós Height, Weight & Measurements
At 60 years old, György Hajós height not available right now. We will update György Hajós's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
| Physical Status |
| Height |
Not Available |
| Weight |
Not Available |
| Body Measurements |
Not Available |
| Eye Color |
Not Available |
| Hair Color |
Not Available |
Dating & Relationship status
He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.
| Family |
| Parents |
Not Available |
| Wife |
Not Available |
| Sibling |
Not Available |
| Children |
Not Available |
György Hajós Net Worth
His net worth has been growing significantly in 2023-2024. So, how much is György Hajós worth at the age of 60 years old? György Hajós’s income source is mostly from being a successful mathematician. He is from Hungary. We have estimated György Hajós's net worth, money, salary, income, and assets.
| Net Worth in 2024 |
$1 Million - $5 Million |
| Salary in 2024 |
Under Review |
| Net Worth in 2023 |
Pending |
| Salary in 2023 |
Under Review |
| House |
Not Available |
| Cars |
Not Available |
| Source of Income |
mathematician |
György Hajós Social Network
| Instagram |
|
| Linkedin |
|
| Twitter |
|
| Facebook |
|
| Wikipedia |
|
| Imdb |
|
Timeline
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.
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 won the Gyula König Prize in 1942, and the Kossuth Prize in 1951 and again in 1962.
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.
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.
Hajós's theorem is named after Hajós, and concerns factorizations of Abelian groups into Cartesian products of subsets of their elements.
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.
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.
In 1965 he was elected to the Romanian Academy of Sciences, and in 1967 to the German Academy of Sciences Leopoldina.
However, it is now known to be false: in 1979, Paul A. Catlin found a counterexample for
, and Paul Erdős and Siemion Fajtlowicz later observed that it fails badly for random graphs.
The Hajós construction is a general method for constructing graphs with a given chromatic number, also due to Hajós.
