Jeff Kahn
Jeffry Ned Kahn is a professor of mathematics at Rutgers University notable for his work in combinatorics. Kahn received his Ph.D from The Ohio State University in 1979 after completing his dissertation under his advisor Dijen K. Ray-Chaudhuri.[1]
In 1980 he showed the importance of the bundle theorem for ovoidal Möbius planes.[2] In 1993, together with Gil Kalai, he disproved Borsuk's conjecture.[3] In 1996 he was awarded the Pólya Prize (SIAM). In 2004, with David Galvin[4] he made seminal contributions to the combinatorial theory of phase transitions.[citation needed]
In 2012, he was awarded Fulkerson Prize (jointly with Anders Johansson and Van H. Vu) for determining the threshold of edge density above which a random graph can be covered by disjoint copies of a given smaller graph.[5][6] Also in 2012, he became a fellow of the American Mathematical Society.[7]
References
- ↑ Jeff Kahn at the Mathematics Genealogy Project
- ↑ Inversive planes satisfying the bundle theorem, Journal Combinatorial Theory, Serie A, Vol.29, 1980, p. 1-19
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Anders Johansson, Jeff Kahn, and Van H. Vu, "Factors in random graphs", Random Structures and Algorithms 33: 1-28, 2008.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-01-27.
