The t-Tone Chromatic Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Alan M. Frieze (Graphs Comb., 2014)

Power of k Choices and Rainbow Spanning Trees in Random Graphs. - Deepak Bal; Patrick Bennett; Alan M. Frieze; Pawel Pralat (Electron. J. Comb., 2015)

The Total Acquisition Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Pawel Pralat (Electron. J. Comb., 2016)

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. - Patrick Bennett; Andrzej Dudek; Alan M. Frieze; Laars Helenius (Electron. J. Comb., 2016)

Rainbow Arborescence in Random Digraphs. - Deepak Bal; Patrick Bennett; Colin Cooper; Alan M. Frieze; Pawel Pralat (J. Graph Theory, 2016)

A note on the random greedy independent set algorithm. - Patrick Bennett; Tom Bohman (Random Struct. Algorithms, 2016)

On the Number of Alternating Paths in Bipartite Complete Graphs. - Patrick Bennett; Andrzej Dudek; Elliot Laforge (Graphs Comb., 2017)

Space proof complexity for random 3-CNFs. - Patrick Bennett; Ilario Bonacina; Nicola Galesi; Tony Huynh; Mike Molloy 001; Paul Wollan (Inf. Comput., 2017)

On the Ramsey-Turán number with small s-independence number. - Patrick Bennett; Andrzej Dudek (J. Comb. Theory B, 2017)

Rainbow perfect matchings and Hamilton cycles in the random geometric graph. - Deepak Bal; Patrick Bennett; Xavier Pérez-Giménez; Pawel Pralat (Random Struct. Algorithms, 2017)

A greedy algorithm for finding a large 2-matching on a random cubic graph. - Deepak Bal; Patrick Bennett; Tom Bohman; Alan M. Frieze (J. Graph Theory, 2018)

A natural barrier in random greedy hypergraph matching. - Patrick Bennett; Tom Bohman (Comb. Probab. Comput., 2019)

Weighted Turán problems with applications. - Patrick Bennett; Sean English; Maria Talanda-Fisher (Discret. Math., 2019)

Large monochromatic components and long monochromatic cycles in random hypergraphs. - Patrick Bennett; Louis DeBiasio; Andrzej Dudek; Sean English (Eur. J. Comb., 2019)

The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. - Deepak Bal; Patrick Bennett (Electron. J. Comb., 2020)

The Sum-Free Process. - Patrick Bennett (Electron. J. Comb., 2020)

Minimizing the number of 5-cycles in graphs with given edge-density. - Patrick Bennett; Andrzej Dudek; Bernard Lidický; Oleg Pikhurko (Comb. Probab. Comput., 2020)

Large triangle packings and Tuza's conjecture in sparse random graphs. - Patrick Bennett; Andrzej Dudek; Shira Zerbib (Comb. Probab. Comput., 2020)

On the number of alternating paths in random graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Discret. Appl. Math., 2021)

Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (SIAM J. Discret. Math., 2021)

The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0, 1/2]$. - Bethany Austhof; Patrick Bennett; Nick Christo (Electron. J. Comb., 2022)

A gentle introduction to the differential equation method and dynamic concentration. - Patrick Bennett; Andrzej Dudek (Discret. Math., 2022)

The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. - Deepak Bal; Patrick Bennett (Electron. J. Comb., 2023)

On the Intersecting Family Process. - Alan M. Frieze; Patrick Bennett; Andrew Newman; Wesley Pegden (Electron. J. Comb., 2024)

The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Pawel Pralat (J. Comb. Theory B, 2024)

On the Chromatic Number of Random Regular Hypergraphs. - Patrick Bennett; Alan M. Frieze (SIAM J. Discret. Math., 2024)

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Elizabeth Sprangel (Graphs Comb., 2024)

Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Electron. J. Comb., 2025)

A Random Coloring Process Gives Improved Bounds for the Erdős-Gyárfás Problem on Generalized Ramsey Numbers. - Patrick Bennett; Andrzej Dudek; Sean English (Electron. J. Comb., 2025)

Weighted Tree Games. - Patrick Bennett; Alan M. Frieze (Electron. J. Comb., 2025)

Extending Wormald's differential equation method to one-sided bounds. - Patrick Bennett; Calum MacRury (Comb. Probab. Comput., 2025)

Some online Maker-Breaker games. - Patrick Bennett; Alan M. Frieze (Discret. Math., 2025)