Patrick Bennett

40 papers Journal 40
YearRankTypeTitle / Venue / Authors
2026 J jnl
Binomial Random Matroids.
CoRR
Patrick Bennett, Alan M. Frieze
2026 J jnl
Generalized Ramsey numbers of cycles, paths, and hypergraphs.
Eur. J. Comb.
Deepak Bal, Patrick Bennett, Emily Heath, Shira Zerbib
2026 J jnl
The intersection of a random geometric graph with an Erdős-Rényi graph.
Discret. Appl. Math.
Patrick Bennett, Alan M. Frieze, Wesley Pegden
2025 J jnl
A Random Coloring Process Gives Improved Bounds for the Erdős-Gyárfás Problem on Generalized Ramsey Numbers.
Electron. J. Comb.
Patrick Bennett, Andrzej Dudek, Sean English
2025 J jnl
Asymptotically optimal constant weight codes with even distance.
Des. Codes Cryptogr.
Patrick Bennett
2025 J jnl
Extending Wormald's differential equation method to one-sided bounds.
Comb. Probab. Comput.
Patrick Bennett, Calum MacRury
2025 J jnl
Generalized Ramsey Numbers at the Linear and Quadratic Thresholds.
Electron. J. Comb.
Patrick Bennett, Ryan Cushman, Andrzej Dudek
2025 J jnl
Some online Maker-Breaker games.
Discret. Math.
Patrick Bennett, Alan M. Frieze
2025 J jnl
Some progress on t-tone coloring.
CoRR
Patrick Bennett, Jade Nichols
2025 J jnl
Weighted Tree Games.
Electron. J. Comb.
Patrick Bennett, Alan M. Frieze
2024 J jnl
A Note on Non-Isomorphic Edge-Color Classes in Random Graphs.
Graphs Comb.
Patrick Bennett, Ryan Cushman, Andrzej Dudek, Elizabeth Sprangel
2024 J jnl
On the Chromatic Number of Random Regular Hypergraphs.
SIAM J. Discret. Math.
Patrick Bennett, Alan M. Frieze
2024 J jnl
On the Intersecting Family Process.
Electron. J. Comb.
Alan M. Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden
2024 J jnl
The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right.
J. Comb. Theory B
Patrick Bennett, Ryan Cushman, Andrzej Dudek, Pawel Pralat
2023 J jnl
Extending Wormald's Differential Equation Method to One-sided Bounds.
CoRR
Patrick Bennett, Calum MacRury
2023 J jnl
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett
2022 J jnl
A gentle introduction to the differential equation method and dynamic concentration.
Discret. Math.
Patrick Bennett, Andrzej Dudek
2022 J jnl
The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0, 1/2]$.
Electron. J. Comb.
Bethany Austhof, Patrick Bennett, Nick Christo
2021 J jnl
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process.
SIAM J. Discret. Math.
Patrick Bennett, Ryan Cushman, Andrzej Dudek
2021 J jnl
On the number of alternating paths in random graphs.
Discret. Appl. Math.
Patrick Bennett, Ryan Cushman, Andrzej Dudek
2020 J jnl
Large triangle packings and Tuza's conjecture in sparse random graphs.
Comb. Probab. Comput.
Patrick Bennett, Andrzej Dudek, Shira Zerbib
2020 J jnl
Minimizing the number of 5-cycles in graphs with given edge-density.
Comb. Probab. Comput.
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko
2020 J jnl
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$.
Electron. J. Comb.
Deepak Bal, Patrick Bennett
2020 J jnl
The Sum-Free Process.
Electron. J. Comb.
Patrick Bennett
2019 J jnl
A natural barrier in random greedy hypergraph matching.
Comb. Probab. Comput.
Patrick Bennett, Tom Bohman
2019 J jnl
Large monochromatic components and long monochromatic cycles in random hypergraphs.
Eur. J. Comb.
Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English
2019 J jnl
Weighted Turán problems with applications.
Discret. Math.
Patrick Bennett, Sean English, Maria Talanda-Fisher
2018 J jnl
A greedy algorithm for finding a large 2-matching on a random cubic graph.
J. Graph Theory
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
2017 J jnl
On the Number of Alternating Paths in Bipartite Complete Graphs.
Graphs Comb.
Patrick Bennett, Andrzej Dudek, Elliot Laforge
2017 J jnl
On the Ramsey-Turán number with small s-independence number.
J. Comb. Theory B
Patrick Bennett, Andrzej Dudek
2017 J jnl
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms
Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat
2017 J jnl
Space proof complexity for random 3-CNFs.
Inf. Comput.
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2016 J jnl
A note on the random greedy independent set algorithm.
Random Struct. Algorithms
Patrick Bennett, Tom Bohman
2016 J jnl
Rainbow Arborescence in Random Digraphs.
J. Graph Theory
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
2016 J jnl
The Total Acquisition Number of Random Graphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett, Andrzej Dudek, Pawel Pralat
2016 J jnl
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs.
Electron. J. Comb.
Patrick Bennett, Andrzej Dudek, Alan M. Frieze, Laars Helenius
2015 J jnl
Power of k Choices and Rainbow Spanning Trees in Random Graphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
2015 J jnl
Space proof complexity for random 3-CNFs.
CoRR
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2014 J jnl
The t-Tone Chromatic Number of Random Graphs.
Graphs Comb.
Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
2012 J jnl
A greedy algorithm for finding a large 2-matching on a random cubic graph
CoRR
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze