2022
Tuza's conjecture for random graphs.
Random Struct. Algorithms, 2022
On a problem of M. Talagrand.
Random Struct. Algorithms, 2022
The Number of Maximal Independent Sets in the Hamming Cube.
Comb., 2022
2021
On symmetric intersecting families of vectors.
Comb. Probab. Comput., 2021
2020
Stability for Maximal Independent Sets.
Electron. J. Comb., 2020
2019
On the cycle space of a random graph.
Random Struct. Algorithms, 2019
Disproof of a packing conjecture of Alon and Spencer.
Random Struct. Algorithms, 2019
Proof of an entropy conjecture of Leighton and Moitra.
J. Comb. Theory, Ser. A, 2019
On Erdős-Ko-Rado for random hypergraphs I.
Comb. Probab. Comput., 2019
On Erdős-Ko-Rado for Random Hypergraphs II.
Comb. Probab. Comput., 2019
Thresholds versus fractional expectation-thresholds.
CoRR, 2019
2018
Chvátal's conjecture and correlation inequalities.
J. Comb. Theory, Ser. A, 2018
2017
Perfect Fractional Matchings in $k$-Out Hypergraphs.
Electron. J. Comb., 2017
2016
On "stability" in the Erdös-Ko-Rado Theorem.
SIAM J. Discret. Math., 2016
The threshold for combs in random graphs.
Random Struct. Algorithms, 2016
Tuza's Conjecture is Asymptotically Tight for Dense Graphs.
Comb. Probab. Comput., 2016
2015
Phase coexistence and torpid mixing in the 3-coloring model on ℤ<sup>d</sup>.
SIAM J. Discret. Math., 2015
Note on a problem of M. Talagrand.
Random Struct. Algorithms, 2015
Mantel's theorem for random graphs.
Random Struct. Algorithms, 2015
Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms.
Electron. J. Comb., 2015
Modular Statistics for Subgraph Counts in Sparse Random Graphs.
Electron. J. Comb., 2015
2013
Left and right convergence of graphs with bounded degree.
Random Struct. Algorithms, 2013
Counting Maximal Antichains and Independent Sets.
Order, 2013
Asymptotics of the Upper Matching Conjecture.
J. Comb. Theory, Ser. A, 2013
Functions without influential coalitions.
CoRR, 2013
A Bipartite Graph with Non-Unimodal Independent Set Sequence.
Electron. J. Comb., 2013
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings.
Proceedings of the Mathematics of Paul Erdős I, 2013
2012
Conditional negative association for competing urns.
Random Struct. Algorithms, 2012
Tight upper tail bounds for cliques.
Random Struct. Algorithms, 2012
Upper tails for triangles.
Random Struct. Algorithms, 2012
2011
A strong log-concavity property for measures on Boolean algebras.
J. Comb. Theory, Ser. A, 2011
The Dual BKR Inequality and Rudich's Conjecture.
Comb. Probab. Comput., 2011
2010
Negative correlation and log-concavity.
Random Struct. Algorithms, 2010
2009
On the Number of 2-SAT Functions.
Comb. Probab. Comput., 2009
Entropy bounds for perfect matchings and Hamiltonian cycles.
Comb., 2009
Hamiltonian cycles in Dirac graphs.
Comb., 2009
2008
Factors in random graphs.
Random Struct. Algorithms, 2008
2007
Thresholds and Expectation Thresholds.
Comb. Probab. Comput., 2007
2006
Some conditional correlation inequalities for percolation and related processes.
Random Struct. Algorithms, 2006
2004
On Phase Transition in the Hard-Core Model on Math.
Comb. Probab. Comput., 2004
2002
Computing Graph Properties by Randomized Subcube Partitions.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002
2001
Singularity Probabilities For Random Matrices Over Finite Fields.
Comb. Probab. Comput., 2001
An Entropy Approach to the Hard-Core Model on Bipartite Graphs.
Comb. Probab. Comput., 2001
2000
Asymptotics of the list-chromatic index for multigraphs.
Random Struct. Algorithms, 2000
A Normal Law for Matchings.
Comb., 2000
The Cover Time, the Blanket Time, and the Matthews Bound.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000
1999
Generalized Rank Functions and an Entropy Argument.
J. Comb. Theory, Ser. A, 1999
1998
Log-Concave Functions And Poset Probabilities.
Comb., 1998
Random Matchings in Regular Graphs.
Comb., 1998
1997
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.
J. Comb. Theory, Ser. A, 1997
On the Stochastic Independence Properties of Hard-Core Distributions.
Comb., 1997
1996
A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
Random Struct. Algorithms, 1996
Asymptotics of the Chromatic Index for Multigraphs.
J. Comb. Theory, Ser. B, 1996
Asymptotically Good List-Colorings.
J. Comb. Theory, Ser. A, 1996
Inclusion-Exclusion: Exact and Approximate.
Comb., 1996
1995
J. Comput. Syst. Sci., 1995
1994
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.
J. Comb. Theory, Ser. A, 1994
1993
On the fractional matching polytope of a hypergraph.
Comb., 1993
1992
Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors.
J. Comb. Theory, Ser. A, 1992
A fractional version of the Erdös-Faber-Lovász conjecture.
Comb., 1992
On a problem of Erdös and Lovász: random lines in a projective plane.
Comb., 1992
1991
Balancing extensions via Brunn-Minkowski.
Comb., 1991
1990
Sphere coverings of the hypercube with incomparable centers.
Discret. Math., 1990
1989
Single-Suit Two-Person Card Play III. The Misère Game.
SIAM J. Discret. Math., 1989
Maximal intersecting families and affine regular polygons in <i>PG</i>(2, <i>q</i>).
J. Comb. Theory, Ser. A, 1989
On the Second Eigenvalue in Random Regular Graphs
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
1988
The Influence of Variables on Boolean Functions (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
Large induced degenerate subgraphs.
Graphs Comb., 1987
On the widths of finite distributive lattices.
Discret. Math., 1987
On Lattices with Möbius Function ±1, 0.
Discret. Comput. Geom., 1987
1986
Addendum to the paper "On the dependence of functions on their variables".
J. Comb. Theory, Ser. A, 1986
A Classification of Modularly Complemented Geometric Lattices.
Eur. J. Comb., 1986
1985
A problem of P. Seymour on nonbinary matroids.
Comb., 1985
1984
A family of perfect graphs associated with directed graphs.
J. Comb. Theory, Ser. B, 1984
A Geometric Approach to Forbidden Minors for GF(3).
J. Comb. Theory, Ser. A, 1984
A topological approach to evasiveness.
Comb., 1984
A polyomino with no stochastic function.
Comb., 1984
Every Poset Has a Good Comparison
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
1982
On the Dependence of Functions on Their Variables.
J. Comb. Theory, Ser. A, 1982
1981
Nonexistence of certain distance-transitive digraphs.
J. Comb. Theory, Ser. B, 1981
1980
Inversive Planes Satisfying the Bundle Theorem.
J. Comb. Theory, Ser. A, 1980
On the maximum number of diagonals of a circuit in a graph.
Discret. Math., 1980
