J. Kahn

activity

19932024

most citedUpper tails for triangles

63 citations · 210 across the 40 of their papers we have counts for

collaborators

55 papers

math.CO2024★ 1 cited

Asymptotics for Palette Sparsification from Variable Lists

Jeff Kahn, Charles Kenney

It is shown that the following holds for each $ε > 0$ . For $G$ an $n$ -vertex graph of maximum degree $D$ , lists $S_{v}$ of size $D + 1$ (for $v \in V (G)$ ), and $L_{v}$ chosen uni…

math.CO2023★ 2 cited

Asymptotics for Palette Sparsification

Jeff Kahn, Charles Kenney

It is shown that the following holds for each $ε > 0$ . For $G$ an $n$ -vertex graph of maximum degree $D$ and "lists" $L_{v}$ ( $v \in V (G)$ ) chosen independently and uniformly…

math.PR2022

A note on positive association

Jeff Kahn

We show that if $A, B, C$ are increasing subsets of $Ω := {0, 1}^{n}$ with $A \neq = \emptyset$ , then with respect to any product probability mea…

math.PR2021

Linear cover time is exponentially unlikely

Quentin Dubroff, Jeff Kahn

Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $ε > 0$ such that for any simple graph $G$ on $V$ of size $n$ , and $X_{0}, \dots$ an ordinary rand…

math.CO2021

On a problem of M. Talagrand

Keith Frankston, Jeff Kahn, Jinyoung Park

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $F$ of subsets of a finite set $V$ . The full conject…

math.CO2020

The threshold for the square of a Hamilton cycle

Jeff Kahn, Bhargav Narayanan, Jinyoung Park

Resolving a conjecture of Kühn and Osthus from 2012, we show that $p = 1/ n$ is the threshold for the random graph $G_{n, p}$ to contain the square of a Hamilton cycle.