| Publication | Date of Publication | Type |
|---|
Large monochromatic components in expansive hypergraphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
European Journal of Combinatorics | 2024-07-08 | Paper |
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
Large monochromatic components in hypergraphs with large minimum codegree
Journal of Graph Theory | 2024-01-30 | Paper |
| Larger matchings and independent sets in regular uniform hypergraphs of high girth | 2023-07-28 | Paper |
| Large monochromatic components in expansive hypergraphs | 2023-02-13 | Paper |
The matching process and independent process in random regular graphs and hypergraphs
The Electronic Journal of Combinatorics | 2023-01-17 | Paper |
| Full Degree Spanning Trees in Random Regular Graphs | 2022-11-10 | Paper |
New lower bounds on the size-Ramsey number of a path
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
Hamiltonian Berge cycles in random hypergraphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
On the size Ramsey number of all cycles versus a path
Discrete Mathematics | 2021-03-25 | Paper |
A note on a candy sharing game
The Art of Discrete and Applied Mathematics | 2021-02-19 | Paper |
Zero-forcing in random regular graphs
Journal of Combinatorics | 2021-02-08 | Paper |
The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
A Ramsey property of random regular and \(k \)-out graphs
Journal of Graph Theory | 2020-05-21 | Paper |
A greedy algorithm for finding a large 2‐matching on a random cubic graph
Journal of Graph Theory | 2018-08-16 | Paper |
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Random Structures & Algorithms | 2017-12-13 | Paper |
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Random Structures & Algorithms | 2017-12-13 | Paper |
Lazy cops and robbers on hypercubes
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Partitioning random graphs into monochromatic components
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Partitioning random graphs into monochromatic components
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Lazy cops and robbers played on random graphs and graphs on surfaces
Journal of Combinatorics | 2016-11-22 | Paper |
Rainbow arborescence in random digraphs
Journal of Graph Theory | 2016-11-16 | Paper |
The total acquisition number of random graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
The total acquisition number of random graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Rainbow matchings and Hamilton cycles in random graphs
Random Structures & Algorithms | 2016-06-10 | Paper |
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
The \(t\)-tone chromatic number of random graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited | 2013-02-05 | Paper |
Packing tight Hamilton cycles in uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
On the maximum number of edges in a hypergraph with a unique perfect matching
Discrete Mathematics | 2012-04-13 | Paper |
A direct-numerical-simulation-based second-moment closure for turbulent magnetohydrodynamic flows
Physics of Fluids | 2010-04-22 | Paper |
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation | 2008-05-19 | Paper |
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
(available as arXiv preprint) | N/A | Paper |
On the multicolor Ramsey numbers of balanced double stars
(available as arXiv preprint) | N/A | Paper |
