Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Jeff Kahn

Modern

Jeffry Ned Kahn is a professor of mathematics at Rutgers University whose work is chiefly in combinatorics. He received his doctorate from Ohio State University in 1979, writing his dissertation under Dijen K. Ray-Chaudhuri. In 1980 he showed the importance of the bundle theorem for ovoidal Mobius planes, and in 1993, together with Gil Kalai, he disproved Borsuk's conjecture. He received the Polya Prize of the Society for Industrial and Applied Mathematics in 1996 and was an invited speaker at the 1994 International Congress of Mathematicians in Zurich. In 2012 he shared the Fulkerson Prize with Anders Johansson and Van H. Vu for determining the edge density threshold above which a random graph can be covered by disjoint copies of a given smaller graph, and he became a fellow of the American Mathematical Society.

Facts
Biography
Gender
Male 1
Connections

Conjectures Posed

Source Kahn-Kalai Conjecture (Wikipedia)

In Branch

Source Jeff Kahn (Wikipedia)

Mentored By

Source Jeff Kahn (Wikipedia)
Sources
1. Jeff Kahn (Wikipedia)
  • Research
    In 1980, he showed the importance of the bundle theorem
  • In Branch: Combinatorics, Lead
    who works primarily in combinatorics
  • Mentored By: Dwijendra Kumar Ray-Chaudhuri, Education
    after completing his dissertation under his advisor Dijen K. Ray-Chaudhuri
View the Source
Kahn-Kalai Conjecture (Wikipedia)
Conjectures Posed: Kahn-Kalai Conjecture, Lead sentence
Quote, Conjectures Posed: Kahn-Kalai Conjecture, Lead sentence
The Kahn-Kalai conjecture, also known as the expectation threshold conjecture or more recently the Park-Pham Theorem, was a conjecture in the field of graph theory and statistical mechanics, proposed by Jeff Kahn and Gil Kalai in 2006.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.