14 citations · 31 across the 10 of their papers we have counts for
8 papers · 1 filter
On "stability" in the Erdős-Ko-Rado theorem
Pat Devlin, Jeff Kahn
Denote by the random subgraph of the usual Kneser graph in which edges appear independently, each with probability . Answering a question of Bollobás, Naraya…
On Erdős-Ko-Rado for random hypergraphs I
Arran Hamm, Jeff Kahn
A family of sets is intersecting if no two of its members are disjoint, and has the Erdős-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty…
Influential coalitions for Boolean Functions
Jean Bourgain, Jeff Kahn, Gil Kalai
We improve results of Kahn, Kalai, and Linial from the late 80s on the existence of influential large coalitions for Boolean functions, and we give counterexamples to conjectures (…
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
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)…