Jeff Kahn

activity

20102016

most citedMantel's Theorem for random graphs

14 citations · 30 across the 10 of their papers we have counts for

collaborators

Showing math.PRShow all

3 papers · 1 filter

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.PR2015★ 9 cited

Turán's Theorem for random graphs

Bobby DeMarco, Jeff Kahn

For a graph $G$ , denote by $t_{r} (G)$ (resp. $b_{r} (G)$ ) the maximum size of a $K_{r}$ -free (resp. $(r - 1)$ -partite) subgraph of $G$ . Of course $t_{r} (G) \geq b_{r} (G)$ for any $G$ , and Turán…

math.PR2012★ 14 cited

Mantel's Theorem for random graphs

Bobby DeMarco, Jeff Kahn

For a graph $G$ , denote by $t (G)$ (resp. $b (G)$ ) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$ . Of course $t (G) \geq b (G)$ for any $G$ , and a classic result…