J. Kahn

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ A strong correlation inequality for contact processes and oriented percolation 1997 Vladimir Belitsky
Pablo A. Ferrari
Norio Konno
Thomas M. Liggett
2
+ Percolation 1999 Geoffrey Grimmett
2
+ PDF Chat An inequality for the weights of two families of sets, their unions and intersections 1978 Rudolf Ahlswede
D. E. Daykin
2
+ A lower bound for the critical probability in a certain percolation process 1960 T. E. Harris
2
+ Stochastic Interacting Systems: Contact, Voter and Exclusion Processes 1999 Thomas M. Liggett
2
+ PDF Chat A correlation inequality for connection events in percolation 2001 J. van den Berg
J. Kahn
1
+ PDF Chat The infamous upper tail 2002 Svante Janson
Andrzej Ruciński
1
+ An upper bound for the number of perfect matchings in graphs 2008 Shmuel Friedland
1
+ PDF Chat Upper tails for triangles 2011 Bobby DeMarco
J. Kahn
1
+ Combinatorial Matrix Functions and 1-Factors of Graphs 1970 Peter M. Gibson
1
+ Irregularities of Distribution 1987 József Beck
William Chen
1
+ Large triangle-free subgraphs in graphs withoutK 4 1986 Péter Frankl
Vojtěch Rödl
1
+ None 2006 Martin Dyer
Abraham D. Flaxman
Alan Frieze
Eric Vigoda
1
+ Triangles in random graphs 2004 Martin Loebl
Jiřı́ Matoušek
Ondřej Pangrác
1
+ PDF Chat Positive correlations in the fuzzy Potts model 1999 Olle Häggström
1
+ Asymptotically Good List-Colorings 1996 Jeff Kahn
1
+ PDF Chat A short proof of Minc's conjecture 1978 Alexander Schrijver
1
+ Contact Interactions on a Lattice 1974 T. E. Harris
1
+ Entropy bounds for perfect matchings and Hamiltonian cycles 2009 Bill Cuckler
Jeff Kahn
1
+ An Entropy Proof of Bregman's Theorem 1997 Jaikumar Radhakrishnan
1
+ PDF Chat Upper tails for subgraph counts in random graphs 2004 Svante Janson
Krzysztof Oleszkiewicz
Andrzej Ruciński
1
+ Matchings and independent sets of a fixed size in regular graphs 2009 Teena Carroll
David Galvin
Prasad Tetali
1
+ The Clique Complex and Hypergraph Matching 2001 Roy Meshulam
1
+ On the Choice Number of Random Hypergraphs 2000 Van H. Vu
1
+ An inequality for permanent of (0, 1)-matrices 1967 Henryk Minc
1
+ The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent 1986 Péter L. Erdős
Péter Frankl
V. Rödl
1
+ PDF Chat The Deletion Method For Upper Tail Estimates 2004 Svante Janson
Andrzej Ruciński
1
+ Topology of random clique complexes 2008 Matthew Kahle
1
+ PDF Chat On the Validations of the Asymptotic Matching Conjectures 2008 Shmuel Friedland
Elliot Krop
P. H. Lundow
Klas Markström
1
+ PDF Chat Applications of Stein’s method for concentration inequalities 2010 Sourav Chatterjee
Partha S. Dey
1
+ PDF Chat Divide and conquer martingales and the number of triangles in a random graph 2004 J. H. Kim
Van H. Vu
1
+ PDF Chat Correlation inequalities on some partially ordered sets 1971 C.M. Fortuin
Piet Kasteleyn
J. Ginibre
1
+ PDF Chat The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence 2008 Noga Alon
Shmuel Friedland
1
+ Percolation and ferromagnetism on Z2: the q-state Potts cases 1996 L. Chayes
1
+ PDF Chat On the Number of Matchings in Regular Graphs 2008 Shmuel Friedland
Elliot Krop
Klas Markström
1
+ Poisson approximation for large deviations 1990 Svante Janson
1
+ Independent sets in hypergraphs 2012 József Balogh
Robert Morris
Wojciech Samotij
1
+ PDF Chat Combinatorial theorems in sparse random sets 2016 David Conlon
W. T. Gowers
1
+ A Large Deviation Result on the Number of Small Subgraphs of a Random Graph 2001 Van H. Vu
1
+ PDF Chat Extremal results for random discrete structures 2016 Mathias Schacht
1
+ PDF Chat Proof of a conjecture of N. Konno for the 1D contact process 2006 Joachim van den Berg
Olle Häggström
J. Kahn
1
+ Percolative Problems 1994 Geoffrey Grimmett
1
+ Mantel's Theorem for random graphs 2012 Bobby DeMarco
Jeff Kahn
1
+ PDF Chat Hypergraph containers 2015 David Saxton
Andrew Thomason
1
+ Interacting Particle Systems 2016 Thomas M. Liggett
1
+ PDF Chat An Entropy Proof of the Kahn-Lovász Theorem 2011 Jonathan Cutler
A. J. Radcliffe
1
+ PDF Chat Arithmetic progressions of length three in subsets of a random set 1996 Yoshiharu Kohayakawa
Tomasz Łuczak
Vojtěch Rödl
1
+ Finite Markov Chains and Algorithmic Applications 2002 Olle Häggström
1