- Daniel Kleitman
Daniel J. Kleitman is a professor of applied mathematics at MIT. His research interests include combinatorics, graph theory, Genomics, and operations research. Kleitman received his PhD from Harvard University in 1958. Kleitman wrote papers with Paul Erdős, giving him an Erdős number of 1. He was a math advisor and extra in "Good Will Hunting." Since Minnie Driver appeared in "Good Will Hunting" and in "Sleepers" with Kevin Bacon, …
- Béla Bollobás
Béla Bollobás is a leading Hungarian mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics and graph theory. His first doctorate was for work in discrete geometry in 1967, after which he spent a year in Moscow with Gelfand. After spending a year in Oxford he went to Cambridge, where in 1971 he received a Ph.D. in functional analysis. He is member of the Hungarian Academy of Sciences.
- Ralph Faudree
Ralph Faudree is a leading mathematician who specializes in combinatorics; specifically graph theory and Ramsey theory. He currently holds the position of Provost of The University of Memphis. He has published more than 150 mathematical papers on these topics together with such notable mathematicians as Bela Bollobas, Stefan Burr, Paul Erdos, Ron Gould, András Gyárfás, Brendan McKay, Cecil Rousseau, Richard Schelp, Miklós Simonovits, Joel Spencer, and Vera Sós.
- Ronald Graham
Ronald Lewis Graham (born October 31, 1935) is a mathematician credited by the American Mathematical Society with being "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years"[1]. He has done important work in scheduling theory, computational geometry, Ramsey theory, and quasi-randomness.
- Andrew Odlyzko
Andrew Odlyzko is a mathematician who is the head of the University of Minnesota's Digital Technology Center. In the field of mathematics he has published extensively on analytic number theory, computational number theory, cryptography, algorithms and computational complexity, combinatorics, probability, and error-correcting codes. In the early 1970s, he was a co-author of one of the founding papers of the modern umbral calculus.
- Fan Chung
Fan Rong K Chung Graham (born October 9, 1949 in Kaohsiung), known professionally as Fan Chung, is a mathematician who works mainly in the areas of spectral graph theory, extremal graph theory and complex networks (see graph theory for the general article). She received her doctorate from the University of Pennsylvania in 1974, under the direction of Herbert Wilf. She is currently the Akamai Professor in Internet Mathematics at the University of California, …
- Carl Pomerance
Carl Pomerance (born in 1944 in Joplin, Missouri) is a well known number theorist. He attended college at Brown University and later received his PhD from Harvard University in 1972 for his study that any odd perfect number N has at least 7 distinct prime factors. He immediately joined the faculty at the University of Georgia, becoming full professor in 1982. He subsequently worked at Lucent Technologies for a number of years, …
- Alfred Tarski
Alfred Tarski (January 14, 1902, Warsaw, Russian-ruled Poland – October 26, 1983, Berkeley, California) was a logician and mathematician who spent four decades as a professor of mathematics at the University of California, Berkeley. A member of the interwar Warsaw School of Mathematics, and active in the USA after 1939, he wrote on topology, geometry, measure theory, mathematical logic, set theory, metamathematics, and above all, model theory, abstract algebra, …
- John Horton Conway
John Horton Conway (born December 26, 1937, Liverpool, England) is a prolific mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He has also contributed to many branches of recreational mathematics, notably the invention of the Game of Life (the cellular automaton, not the board game). Conway is currently professor of mathematics at Princeton University.
- Cecil C. Rousseau
Cecil C. Rousseau is a mathematician and author who specializes in graph theory and combinatorics. He is a professor at The University of Memphis and former chair of the USAMO. He has an Erdős number of 1, and is among Erdős' top 10 co-authors. To his students and colleagues, he's known affectionately as C<sup>2</sup>R.
- Michael Golomb
Michael Golomb (born 1909) is an American mathematician and educator who is affiliated with Purdue University for over half a century. He was a student of Erhard Schmidt and Adolf Hammerstein, and received his doctorate from the University of Berlin in 1933. However, as a Jew, he had to leave Germany shortly afterwards to avoid Nazi persecution. After a short period in Zagreb in the former Yugoslavia, Michael Golomb arrived in the U.S. in 1939, …
- Joel Spencer
Joel Spencer (born April 20, 1946) is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason. He is currently (as of 2007) a professor at the Courant Institute of Mathematical Sciences of New York University.
- Arthur Rubin
Arthur L. Rubin is an American mathematician who has earned a place among the five top-ranked undergraduate competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times (1970–73), a feat matched by only six other undergraduate students since the first competition in 1938. His mother was J. E. H. Rubin, Professor of Mathematics at Purdue University for over 35 years, and his father, H. Rubin, …
- Yousef Alavi
Yousef Alavi is a mathematician who specializes in combinatorics and graph theory. He was a professor at Western Michigan University. His Erdős number is 1.
- Persi Diaconis
Persi Warren Diaconis (born January 31, 1945) is an American mathematician and former professional magician. He is Mary V. Sunseri professor of statistics and professor of mathematics at Stanford University. He is particularly known for tackling mathematical problems involving randomness and randomization, such as coin flipping and shuffling playing cards. Professor Diaconis achieved brief national fame when he received a MacArthur Fellowship in 1979, …
- Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician who made contributions in combinatorics and graph theory but mostly in probability theory. He proved, using the large sieve, that there is a number <math>K</math> such that every even number is the sum of a prime number and a number that can be written as the product of at most <math>K</math> primes. See also Goldbach conjecture. In information theory, he introduced the spectrum of Rényi entropies of order α, …
- Saharon Shelah
Saharon Shelah (born July 3, 1945 in Jerusalem) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and also at Rutgers University in New Jersey, USA. Shelah's main interest lies in mathematical logic, in particular in model theory and set theory. Shelah is one of the most prolific contemporary mathematicians. As of 2006, he had (together with over 200 coauthors) published nearly 900 mathematical papers.
- László Lovász
László Lovász is a mathematician, known for work in combinatorics, for which he was in 1999 awarded a Wolf Prize. In 1999 he was also awarded the Knuth Prize. Lovász received his Ph.D. in 1970 at Eötvös Loránd University. His advisor was Tibor Gallai, professor at the University of Szeged. Lovász was a professor at Yale University during the 1990s and was a collaborative member of the Microsoft Research Center until 2006. Now he is back at the Eötvös University, …
- Frank Harary
Frank Harary was a prolific American mathematician, who specialized in graph theory. Among the more than 700 scholarly articles Harary authored, two were co-authored with Paul Erdős, giving Harary an Erdős number of 1.
- Mario Szegedy
Mario Szegedy is a Hungarian computer scientist, professor of computer science at Rutgers University. He received his Ph.D. in computer science from the University of Chicago. Szegedy's research areas include complexity theory and quantum computing. He was awarded the Gödel Prize twice in 2001 and 2005 for his work on probabilistically checkable proofs and on the space complexity of approximating the frequency moments in streamed data.
- Noga Alon
Noga Alon is an Israeli mathematician noted for his prolific contributions to combinatorics and theoretical computer science, having authored hundreds of papers. He received his PhD from the Hebrew University of Jerusalem in 1983 and is currently on the faculty of Tel Aviv University. Alon is the principal founder of the powerful Combinatorial Nullstellensatz which has many applications in combinatorics and number theory.
- Richard Rado
Richard Rado was a German mathematician who was interviewed in Berlin by Lord Cherwell for a scholarship given by the chemist Sir Robert Mond which provided financial support to study at Cambridge. After he was awarded the scholarship, Rado and his wife left for the UK in 1933. He made contributions in combinatorics and graph theory. He wrote 18 papers with Paul Erdős. In 1964, he discovered the Rado graph. Rado was Jewish.
- András Gyárfás
András Gyárfás ,is a Hungarian mathematician who specializes in combinatorics and graph theory. His Erdős number is 1. http://www.sztaki.hu/munkatars/008001049/ http://wwwold.sztaki.hu/sztaki/ake/applmath/discret/gyarfas_cv.hu.jhtml [[http://www1.cs.columbia.edu/~sanders/graphtheory/people/random.cgi?Gy*aacute;rf*aacute;s,+Andr*aacute;s]
- W. T. Tutte
William Thomas Tutte (May 14 1917 - May 2 2002) was a British, later Canadian, codebreaker and mathematician. During World War II he broke a major German code system, which had a significant impact on the Allied invasion of Europe. He also had a number of significant mathematical accomplishments, including foundation work in the fields of combinatorics and graph theory. Tutte was born in Newmarket in Suffolk, the son of a gardener.
- Stanislaw Ulam
Stanisław Marcin Ulam was a Polish-born American mathematician who participated in the Manhattan Project and proposed the Teller–Ulam design of thermonuclear weapons. He also invented nuclear pulse propulsion and developed a number of mathematical tools in number theory, set theory, ergodic theory, and algebraic topology.
- Underwood Dudley
Underwood Dudley (born January 6, 1937) is a mathematician, formerly of DePauw University, who has written a number of research works and textbooks but is best known for his popular writing. Most notable are several books describing crank mathematics by people who think they have squared the circle or done other impossible things. That sort of work is thrown away by most professionals, but Dudley has saved and analyzed it, calling it the folklore of mathematics.
- Esther Szekeres
Esther Szekeres (born Klein was a Hungarian-Australian mathematician. As a young woman in Budapest she was part of a group that included Paul Erdős, George Szekeres and Paul Turán, who met over interesting mathematical problems. In 1933, Esther proposed a combinatorial problem to the group that came to be named by Paul Erdős as the Happy Ending problem, because it led to her marriage with George Szekeres in 1937.
- Robin Wilson
Robin James Wilson (born December 1943) is a professor in the Department of Mathematics at the Open University, a fellow by special election of Keble College, Oxford and, as of 2006, professor of geometry at Gresham College, London, where he has also been a visiting professor. On occasion, he guest teaches at Colorado College.
- László Babai
László Babai, born in 1950, is a professor of mathematics and computer science at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields. He is the author of over 150 academic papers. His notable accomplishments include the introduction of interactive proofs (see). He received his doctorate from Eötvös University in Hungary in 1975.
- Endre Szemerédi
Endre Szemerédi is a Hungarian mathematician, working in the field of combinatorics, currently professor at Rutgers University. He was born in Budapest. His masters in mathematics were Paul Erdős and András Hajnal. He is best known for his proof from 1975 of an old conjecture of Erdős and Paul Turán: if a sequence of natural numbers has positive upper density then it contains arbitrarily long arithmetic progressions. This is now known as Szemerédi's theorem.
- Harold Davenport
Harold Davenport (30 October 1907 - 9 June 1969) was an English mathematician, known for his extensive work in number theory.
- Gustavus Simmons
Gustavus J. Simmons (1930-) is a retired cryptographer and former manager of the Applied Mathematics Department at Sandia National Laboratories. He has worked primarily with authentication theory, developing cryptographic techniques for solving problems of mutual distrust. Simmons was born in West Virginia and was named after his grand-father, a Prohibition officer who was gunned down three years before Gustavus was born.
- George Szekeres
George Szekeres (May 29, 1911 - August 28, 2005) was a Hungarian-Australian mathematician.
- William Feller
William (Vilim) Feller (July 7 1906 - January 14 1970), born Willibrord, was a Croatian-American mathematician specializing in probability theory.
- Andrzej Schinzel
Andrzej Schinzel is a Polish mathematician, studying mainly number theory. He is a professor at the Institute of Mathematics of the Polish Academy of Sciences (IM PAN). A conjecture of his on the prime values of polynomials, known as Schinzel's hypothesis H, has attracted attention from other number theorists. Schinzel received his Ph.D. in 1960 from Warsaw University.
- Andrew Granville
Andrew Granville is a British mathematician, working in the field of number theory. He has been a faculty member at the Université de Montréal since 2002. Before moving to Montreal he was a mathematics professor at University of Georgia (UGA) from 1991 until 2002. He was a section speaker in the 1994 International Congress of Mathematicians together with Dr. Carl Pomerance from UGA.
- Leonidas Alaoglu
Leonidas Alaoglu (March 19, 1914 - August, 1981) was a Canadian mathematician of Greek descent, born in Red Deer, Alberta, who lived for many years in the Los Angeles area. He received his BS in 1936, Master's in 1937, and PhD in 1938 (at the age of 24), all from the University of Chicago. His thesis was entitled "Weak topologies of normed linear spaces". His advisor was Lawrence M. Graves.
- Péter Frankl
Péter Frankl is a Hungarian mathematician and street performer, and is Jewish. Frankl has lived in Japan since 1988, where he sometimes appears on NHK. Though not as popular as he once was, he still performs juggling in public spaces around Tokyo. Frankl won the gold medal at the International Mathematical Olympiad in 1971. His Ph.D. advisor was Gyula O.H. Katona and he has six joint papers with Paul Erdős
- Brendan McKay
Brendan D. McKay (b. October 26, 1951 in Melbourne, Australia) is a Professor in the Department of Computer Science at ANU (Australian National University). He has published extensively in combinatorics. One of his main contributions has been a practical algorithm for graph isomorphism and its software implementation NAUTY (No AUTomorphisms, Yes?). Further achievements include proving with Radziszowski that the Ramsey Number R(4,5)=25, …
- Tibor Gallai
Tibor Gallai was a Hungarian mathematician. He worked in graph theory and collaborated with Paul Erdős. He was a student of Dénes König and an advisor of László Lovász.