Emanuel Grinberg (1911 to 1982), in Latvian Emanuels Grinbergs, was a Latvian mathematician best known for Grinberg's theorem, a necessary condition for a planar graph to contain a Hamiltonian cycle that has often been used to build non-Hamiltonian planar graphs. He was born in St. Petersburg on 25 January 1911 and grew up in Riga after his family returned to Latvia, studying at the University of Latvia and at the Ecole Normale Superieure in Paris. His career was disrupted by the Second World War and the Soviet occupation, after which he worked in a radio factory before returning to the university and then the University of Latvia Computer Center. His research covered geometry, graph theory, electrical circuit design, spline-based ship hull design and operations research.
Facts
Connections
In Branch
Source Emanuels Grīnbergs (Wikipedia)
Principal Result
Source Emanuels Grīnbergs (Wikipedia)
Proofs Credited
Source Grinberg's theorem (Wikipedia)
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Emanuels Grīnbergs (Wikipedia)LeadQuote, Lead
was a Latvian mathematician
Sources
1. MacTutor History of Mathematics: Emanuels Grinbergs (MacTutor)
MacTutor History of MathematicsBiography
He won a prize which enabled him to travel to Lille in France in 1927
Quick Info, born
25 January 1911
View the Source Emanuels Grīnbergs (Wikipedia)
Lead
was a Latvian mathematician
In Branch: Graph Theory, Research
In graph theory, Grinbergs is best known for Grinberg's theorem
View the SourceGrinberg's theorem (Wikipedia)
Proofs Credited: Grinberg's Theorem, Lead sentenceQuote, Proofs Credited: Grinberg's Theorem, Lead sentence
Grinberg's theorem is named after Latvian mathematician Emanuel Grinberg, who proved it in 1968.
View the Source 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.