14 citations · 19 across the 6 of their papers we have counts for
6 papers
On phase transition in the hard-core model on
David Galvin, Jeff Kahn
It is shown that the hard-core model on exhibits a phase transition at activities above some function which tends to zero as
Mantel's Theorem for random graphs
Bobby DeMarco, Jeff Kahn
For a graph , denote by (resp. ) the maximum size of a triangle-free (resp. bipartite) subgraph of . Of course for any , and a classic result…
Asymptotics of the Upper Matching Conjecture
Liviu Ilinca, Jeff Kahn
We give upper bounds for the number of matchings of size in (i) bipartite graphs with specified degrees (), and (ii) general graph…
Counting maximal antichains and independent sets
Liviu Ilinca, Jeff Kahn
Answering several questions of Duffus, Frankl and Rödl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii)…
The number of 3-SAT functions
Liviu Ilinca, Jeff Kahn
With the number of functions of boolean variables definable by -SAT formulae, we prove that is asymptotic to . This is a strong form of…
Left and right convergence of graphs with bounded degree
Christian Borgs, Jennifer Chayes, Jeff Kahn +1
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorph…