Jeff Kahn (mathematician)

Jeffry Ned Kahn is a professor of mathematics at Rutgers University notable for his work in combinatorics.

Kahn received his Ph.D. from Ohio State University in 1979 after completing his dissertation under his advisor Dijen K.

[1] In 1980 he showed the importance of the bundle theorem for ovoidal Möbius planes.

He 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.