Jeffry Ned Kahn is a professor of mathematics at Rutgers University notable for his work in combinatorics.
Education
editKahn received his Ph.D. from Ohio State University in 1979 after completing his dissertation under his advisor Dijen K. Ray-Chaudhuri.[1]
Research
editIn 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).
Awards and honors
editHe was an invited speaker at the 1994 International Congress of Mathematicians in Zurich.[citation needed]
In 2012, he was awarded the 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.[4][5] Also in 2012, he became a fellow of the American Mathematical Society.[6]
References
edit- ^ Jeff Kahn at the Mathematics Genealogy Project
- ^ Inversive planes satisfying the bundle theorem, Journal Combinatorial Theory, Serie A, Vol.29, 1980, p. 1-19
- ^ Kahn, Jeff; Kalai, Gil (1993), "A counterexample to Borsuk's conjecture", Bulletin of the American Mathematical Society, 29: 60–62, arXiv:math.MG/9307229, doi:10.1090/S0273-0979-1993-00398-7, MR 1193538, S2CID 119647518.
- ^ Anders Johansson, Jeff Kahn, and Van H. Vu (2008). "Factors in random graphs". Random Structures and Algorithms. 33 (1): 1–28. arXiv:0803.3406. doi:10.1002/rsa.20224. S2CID 14337643.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ "Delbert Ray Fulkerson Prize". American Mathematical Society (AMS). Retrieved 3 Jan 2013.
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-01-27.