| Publication | Date of Publication | Type |
|---|
A critical probability for biclique partition of \(G_{n,p}\)
Journal of Combinatorial Theory. Series B | 2024-03-14 | Paper |
Two-Point Concentration of the Independence Number of the Random Graph
Forum of Mathematics, Sigma | 2024-02-28 | Paper |
Independent sets in hypergraphs omitting an intersection
Random Structures & Algorithms | 2023-10-17 | Paper |
Dynamic concentration of the triangle‐free process
Random Structures & Algorithms | 2023-10-11 | Paper |
Coprime mappings and lonely runners
Mathematika | 2023-09-20 | Paper |
On Multicolor Ramsey Numbers of Triple System Paths of Length 3
SIAM Journal on Discrete Mathematics | 2023-08-10 | Paper |
A construction for Boolean cube Ramsey numbers
Order | 2023-07-18 | Paper |
Complexes of nearly maximum diameter
| 2022-04-25 | Paper |
A natural barrier in random greedy hypergraph matching
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Large girth approximate Steiner triple systems
Journal of the London Mathematical Society | 2020-02-26 | Paper |
Independence number of graphs with a prescribed number of cliques
The Electronic Journal of Combinatorics | 2019-05-20 | Paper |
A greedy algorithm for finding a large 2‐matching on a random cubic graph
Journal of Graph Theory | 2018-08-16 | Paper |
More on the bipartite decomposition of random graphs
Journal of Graph Theory | 2017-02-01 | Paper |
A note on the random greedy independent set algorithm
Random Structures & Algorithms | 2016-11-09 | Paper |
The independent neighborhoods process
Israel Journal of Mathematics | 2016-09-15 | Paper |
Random triangle removal
Advances in Mathematics | 2015-05-29 | Paper |
On the independence numbers of the cubes of odd cycles
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Dynamic concentration of the triangle-free process
| 2014-06-11 | Paper |
Turán densities of some hypergraphs related to \(K_{k+1}^{k}\)
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
SIR epidemics on random graphs with a fixed degree sequence
Random Structures & Algorithms | 2012-10-26 | Paper |
Hypergraphs with independent neighborhoods
Combinatorica | 2011-12-19 | Paper |
Karp-Sipser on random graphs with a fixed degree sequence
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
Random greedy triangle-packing beyond the 7/4 barrier
| 2011-08-08 | Paper |
A note on the random greedy triangle-packing algorithm
Journal of Combinatorics | 2011-06-27 | Paper |
Flips in graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
The saturation function of complete partite graphs
Journal of Combinatorics | 2011-06-14 | Paper |
Ramsey games with giants
Random Structures & Algorithms | 2011-01-17 | Paper |
Coloring \(H\)-free hypergraphs
Random Structures & Algorithms | 2010-11-10 | Paper |
Hamilton cycles in 3-out
Random Structures & Algorithms | 2010-11-09 | Paper |
The early evolution of the \(H\)-free process
Inventiones Mathematicae | 2010-07-06 | Paper |
Memoryless rules for Achlioptas processes
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Erdős-Ko-Rado in random hypergraphs
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Anti-Ramsey properties of random graphs
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Maximum independent sets in certain powers of odd cycles
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The triangle-free process
Advances in Mathematics | 2009-06-10 | Paper |
Game chromatic index of graphs with given restrictions on degrees
Theoretical Computer Science | 2008-11-18 | Paper |
The game chromatic number of random graphs
Random Structures & Algorithms | 2008-03-28 | Paper |
Creating a Giant Component
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Product rule wins a competitive game
Proceedings of the American Mathematical Society | 2007-07-27 | Paper |
First-Order Definability of Trees and Sparse Random Graphs
Combinatorics, Probability and Computing | 2007-05-15 | Paper |
Randomly generated intersecting hypergraphs II
Random Structures & Algorithms | 2007-02-07 | Paper |
A phase transition for avoiding a giant component
Random Structures & Algorithms | 2006-05-16 | Paper |
Linear versus hereditary discrepancy
Combinatorica | 2005-10-04 | Paper |
A nontrivial lower bound on the shannon capacities of the complements of odd cycles
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
A limit theorem for the Shannon capacities of odd cycles. II
Proceedings of the American Mathematical Society | 2004-10-28 | Paper |
On the irregularity strength of trees
Journal of Graph Theory | 2004-03-29 | Paper |
Adding random edges to dense graphs
Random Structures & Algorithms | 2004-03-29 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
A limit theorem for the Shannon capacities of odd cycles I
Proceedings of the American Mathematical Society | 2003-07-28 | Paper |
Arc-Disjoint Paths in Expander Digraphs
SIAM Journal on Computing | 2003-06-19 | Paper |
How many random edges make a dense graph hamiltonian?
Random Structures & Algorithms | 2003-03-19 | Paper |
On a list coloring conjecture of Reed
Journal of Graph Theory | 2003-03-19 | Paper |
A note on \(G\)-intersecting families
Discrete Mathematics | 2003-03-16 | Paper |
On partitions of discrete boxes
Discrete Mathematics | 2002-12-02 | Paper |
\(G\)-intersecting families
Combinatorics, Probability and Computing | 2002-11-24 | Paper |
Addendum to ‘avoiding a giant component’
Random Structures & Algorithms | 2002-11-17 | Paper |
Avoiding a giant component
Random Structures & Algorithms | 2002-06-06 | Paper |
Vertex covers by edge disjoint cliques
Combinatorica | 2002-02-13 | Paper |
Six lonely runners
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
min-wise independent linear permutations
The Electronic Journal of Combinatorics | 2000-05-11 | Paper |
A note on sparse random graphs and cover graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
Random threshold growth dynamics
| 2000-03-13 | Paper |
Discrete threshold growth dynamics are omnivorous for box neighborhoods
Transactions of the American Mathematical Society | 1999-01-27 | Paper |
A construction for sets of integers with distinct subset sums
The Electronic Journal of Combinatorics | 1998-02-18 | Paper |
A sum packing problem of Erdös and the Conway-Guy sequence
Proceedings of the American Mathematical Society | 1996-12-10 | Paper |
Two-Point Concentration of the Domination Number of Random Graphs
| N/A | Paper |
