Name
Affiliation
Papers
JEFF KAHN
Rutgers State Univ, Dept Math, New Brunswick, NJ 07102 USA
32
Collaborators
Citations 
PageRank 
32
304
42.26
Referers 
Referees 
References 
477
131
132
Search Limit
100477
Title
Citations
PageRank
Year
Stability for maximal independent sets00.342020
On Erdős-Ko-Rado for Random Hypergraphs II.00.342019
On the cycle space of a random graph.00.342019
Proof of an entropy conjecture of Leighton and Moitra.00.342019
Chvátal's conjecture and correlation inequalities.00.342018
Perfect Fractional Matchings in $k$-Out Hypergraphs.00.342017
The threshold for combs in random graphs.00.342016
On "stability" in the Erdös-Ko-Rado Theorem.40.452016
Tuza's Conjecture is Asymptotically Tight for Dense Graphs20.512016
Note on a problem of M. Talagrand00.342015
Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms00.342015
Mantel's theorem for random graphs40.582015
Phase coexistence and torpid mixing in the 3-coloring model on ℤd.00.342015
Left and right convergence of graphs with bounded degree100.782013
Functions without influential coalitions.00.342013
Factors in random graphs121.012008
Thresholds and Expectation Thresholds50.802007
An Entropy Approach to the Hard-Core Model on Bipartite Graphs324.332001
Singularity Probabilities for Random Matrices over Finite Fields80.672001
A Normal Law for Matchings111.202000
Log-Concave Functions And Poset Probabilities70.541998
Random Matchings in Regular Graphs81.301998
On The Stochastic Independence Properties Of Hard-Core Distributions50.631997
Inclusion-Exclusion: Exact and Approximate.373.071996
Entropy and sorting170.931995
On the fractional matching polytope of a hypergraph181.211993
Entropy and sorting192.351992
A fractional version of the Erdös-Faber-Lovász conjecture40.601992
Coloring nearly-disjoint hypergraphs with n + o(n) colors242.591992
Balancing extensions via Brunn-Minkowski.40.671991
The Influence of Variables on Boolean Functions (Extended Abstract)499.851988
Large induced degenerate subgraphs.244.481987