Patrick Bennett

Orcid: 0000-0003-3147-4690

According to our database¹, Patrick Bennett authored at least 28 papers between 2014 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

On the Chromatic Number of Random Regular Hypergraphs.

[BibT_eX]

[DOI]

Patrick Bennett

Alan M. Frieze

SIAM J. Discret. Math., 2024

The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

On the Intersecting Family Process.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Extending Wormald's Differential Equation Method to One-sided Bounds.

[BibT_eX]

[DOI]

Patrick Bennett

Calum MacRury

CoRR, 2023

The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Deepak Bal

Patrick Bennett

Electron. J. Comb., 2023

2022

A gentle introduction to the differential equation method and dynamic concentration.

[BibT_eX]

[DOI]

Patrick Bennett

Andrzej Dudek

Discret. Math., 2022

The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0, 1/2]$.

[BibT_eX]

[DOI]

Bethany Austhof

Patrick Bennett

Nick Christo

Electron. J. Comb., 2022

2021

Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process.

[BibT_eX]

[DOI]

Patrick Bennett

Ryan Cushman

Andrzej Dudek

SIAM J. Discret. Math., 2021

On the number of alternating paths in random graphs.

[BibT_eX]

[DOI]

Patrick Bennett

Ryan Cushman

Andrzej Dudek

Discret. Appl. Math., 2021

2020

Large triangle packings and Tuza's conjecture in sparse random graphs.

[BibT_eX]

[DOI]

Patrick Bennett

Andrzej Dudek

Shira Zerbib

Comb. Probab. Comput., 2020

Minimizing the number of 5-cycles in graphs with given edge-density.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

The Sum-Free Process.

[BibT_eX]

[DOI]

Patrick Bennett

Electron. J. Comb., 2020

The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$.

[BibT_eX]

[DOI]

Deepak Bal

Patrick Bennett

Electron. J. Comb., 2020

2019

Large monochromatic components and long monochromatic cycles in random hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Weighted Turán problems with applications.

[BibT_eX]

[DOI]

Patrick Bennett

Sean English

Maria Talanda-Fisher

Discret. Math., 2019

A natural barrier in random greedy hypergraph matching.

[BibT_eX]

[DOI]

Patrick Bennett

Tom Bohman

Comb. Probab. Comput., 2019

2018

A greedy algorithm for finding a large 2-matching on a random cubic graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

2017

Rainbow perfect matchings and Hamilton cycles in the random geometric graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

On the Ramsey-Turán number with small s-independence number.

[BibT_eX]

[DOI]

Patrick Bennett

Andrzej Dudek

J. Comb. Theory B, 2017

Space proof complexity for random 3-CNFs.

[BibT_eX]

[DOI]

Inf. Comput., 2017

On the Number of Alternating Paths in Bipartite Complete Graphs.

[BibT_eX]

[DOI]

Patrick Bennett

Andrzej Dudek

Elliot Laforge

Graphs Comb., 2017

2016

A note on the random greedy independent set algorithm.

[BibT_eX]

[DOI]

Patrick Bennett

Tom Bohman

Random Struct. Algorithms, 2016

Rainbow Arborescence in Random Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

The Total Acquisition Number of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Power of k Choices and Rainbow Spanning Trees in Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

The t-Tone Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Patrick Bennett

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...