63 citations · 210 across the 40 of their papers we have counts for
7 papers · 1 filter
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 (…
Tuza's Conjecture is Asymptotically Tight for Dense Graphs
Jacob D. Baron, Jeff Kahn
An old conjecture of Zs. Tuza says that for any graph , the ratio of the minimum size, , of a set of edges meeting all triangles to the maximum size, , of an edg…
On Erdős-Ko-Rado for random hypergraphs II
Arran Hamm, Jeff Kahn
Denote by the random -graph in which each -subset of is present with probability , independent of other choices. More or less answering…
Modular statistics for subgraph counts in sparse random graphs
Bobby DeMarco, Jeff Kahn, Amanda Redlich
Answering a question of Kolaitis and Kopparty, we show that, for given integer and pairwise nonisomorphic connected graphs , if is such that $\Pr(G_{n,p}…
The threshold for combs in random graphs
Jeff Kahn, Eyal Lubetzky, Nicholas Wormald
For let denote the tree consisting of an -vertex path with disjoint -vertex paths beginning at each of its vertices. An old conjecture says that fo…