Patrick Bennett

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 26

Top Topics

Independent Set

Conjunctive Query Containment

Greedy Approximation Algorithm

Top Venues

Electron. J. Comb.

Comb. Probab. Comput.

SIAM J. Discret. Math.

Publications

Patrick Bennett, Ryan Cushman, Andrzej Dudek, Pawel Pralat
The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. J. Comb. Theory B 169 (2024)
Patrick Bennett, Alan M. Frieze
On the Chromatic Number of Random Regular Hypergraphs. SIAM J. Discret. Math. 38 (2) (2024)
Deepak Bal, Patrick Bennett
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Electron. J. Comb. 30 (1) (2023)
Patrick Bennett, Calum MacRury
Extending Wormald's Differential Equation Method to One-sided Bounds. CoRR (2023)
Patrick Bennett, Andrzej Dudek
A gentle introduction to the differential equation method and dynamic concentration. Discret. Math. 345 (12) (2022)
Bethany Austhof, Patrick Bennett, Nick Christo
The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0, 1/2]$. Electron. J. Comb. 29 (1) (2022)
Patrick Bennett, Ryan Cushman, Andrzej Dudek
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. SIAM J. Discret. Math. 35 (3) (2021)
Patrick Bennett, Ryan Cushman, Andrzej Dudek
On the number of alternating paths in random graphs. Discret. Appl. Math. 304 (2021)
Deepak Bal, Patrick Bennett
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. Electron. J. Comb. 27 (4) (2020)
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29 (1) (2020)
Patrick Bennett, Andrzej Dudek, Shira Zerbib
Large triangle packings and Tuza's conjecture in sparse random graphs. Comb. Probab. Comput. 29 (5) (2020)
Patrick Bennett
The Sum-Free Process. Electron. J. Comb. 27 (1) (2020)
Patrick Bennett, Tom Bohman
A natural barrier in random greedy hypergraph matching. Comb. Probab. Comput. 28 (6) (2019)
Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English
Large monochromatic components and long monochromatic cycles in random hypergraphs. Eur. J. Comb. 76 (2019)
Patrick Bennett, Sean English, Maria Talanda-Fisher
Weighted Turán problems with applications. Discret. Math. 342 (8) (2019)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88 (3) (2018)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. Inf. Comput. 255 (2017)
Patrick Bennett, Andrzej Dudek
On the Ramsey-Turán number with small s-independence number. J. Comb. Theory, Ser. B 122 (2017)
Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. Random Struct. Algorithms 51 (4) (2017)
Patrick Bennett, Andrzej Dudek, Elliot Laforge
On the Number of Alternating Paths in Bipartite Complete Graphs. Graphs Comb. 33 (2) (2017)
Patrick Bennett, Andrzej Dudek, Alan M. Frieze, Laars Helenius
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. Electron. J. Comb. 23 (2) (2016)
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83 (3) (2016)
Patrick Bennett, Tom Bohman
A note on the random greedy independent set algorithm. Random Struct. Algorithms 49 (3) (2016)
Deepak Bal, Patrick Bennett, Andrzej Dudek, Pawel Pralat
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23 (2) (2016)
Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. 22 (1) (2015)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. CoRR (2015)
Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30 (5) (2014)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph CoRR (2012)