Martin Aigner
Encyclopedia
Martin Aigner is an Austria
n mathematician
, professor at Freie Universität Berlin since 1974, with interests in combinatorial mathematics and graph theory
.
He received Ph.D from the University of Vienna
. His book Proofs from THE BOOK
has been translated into 12 languages.
He is a recipient of the 1996 Lester R. Ford Award for his expository article Turan's Theorem
Austria
Austria , officially the Republic of Austria , is a landlocked country of roughly 8.4 million people in Central Europe. It is bordered by the Czech Republic and Germany to the north, Slovakia and Hungary to the east, Slovenia and Italy to the south, and Switzerland and Liechtenstein to the...
n mathematician
Mathematician
A mathematician is a person whose primary area of study is the field of mathematics. Mathematicians are concerned with quantity, structure, space, and change....
, professor at Freie Universität Berlin since 1974, with interests in combinatorial mathematics and graph theory
Graph theory
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of...
.
He received Ph.D from the University of Vienna
University of Vienna
The University of Vienna is a public university located in Vienna, Austria. It was founded by Duke Rudolph IV in 1365 and is the oldest university in the German-speaking world...
. His book Proofs from THE BOOK
Proofs from THE BOOK
Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler. The book is dedicated to the mathematician Paul Erdős, who often referred to "The Book" in which God keeps the most elegant proof of each mathematical theorem...
has been translated into 12 languages.
He is a recipient of the 1996 Lester R. Ford Award for his expository article Turan's Theorem
Turán's theorem
In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph.An n-vertex graph that does not contain any -vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly-equal size, and connecting two vertices by an edge whenever they...