Jeff Kahn

activity

20102024

most citedMantel's Theorem for random graphs

14 citations · 32 across the 12 of their papers we have counts for

collaborators

Showing 2012Show all

4 papers · 1 filter

math.CO2012

On phase transition in the hard-core model on $Z^{d}$

David Galvin, Jeff Kahn

It is shown that the hard-core model on $Z^{d}$ exhibits a phase transition at activities above some function $λ (d)$ which tends to zero as $d \to \infty$

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…

math.CO2012

Asymptotics of the Upper Matching Conjecture

Liviu Ilinca, Jeff Kahn

We give upper bounds for the number $Φ_{ℓ} (G)$ of matchings of size $ℓ$ in (i) bipartite graphs $G = (X \cup Y, E)$ with specified degrees $d_{x}$ ( $x \in X$ ), and (ii) general graph…

math.CO2012★ 1 cited

Counting maximal antichains and independent sets