Tibor Gallai (born Tibor Grünwald, 15 July 1912 to 2 January 1992) was a Hungarian mathematician who worked in combinatorics, especially graph theory, and was a lifelong friend and collaborator of Paul Erdős. He was a student of Dénes Kőnig and an advisor of László Lovász, and a corresponding member of the Hungarian Academy of Sciences from 1991. The Edmonds-Gallai decomposition theorem, proved independently by Gallai and Jack Edmonds, describes finite graphs from the point of view of matchings. Gallai was the first to prove the higher-dimensional version of van der Waerden's theorem, and with Erdős he gave the Erdős-Gallai condition for a sequence to be the degree sequence of a graph.
Facts
Connections
In Branch
Source Wikipedia: Tibor Gallai
Proofs Credited
Source Sylvester-Gallai Theorem (Wikipedia)
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Tibor Gallai
LeadQuote, Lead
He worked in combinatorics, especially in graph theory, and was a lifelong friend and collaborator of Paul Erdős.
Sylvester-Gallai Theorem (Wikipedia)
Wikimedia FoundationProofs Credited: Sylvester-Gallai Theorem, LeadQuote, Proofs Credited: Sylvester-Gallai Theorem, Lead
Unaware of Melchior's proof, Paul Erdős (1943) again stated the conjecture, which was subsequently proved by Tibor Gallai, and soon afterwards by other authors.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.