Patrick Bennett

Patrick Bennett

Western Michigan University

H-index: 9

North America-United States

About Patrick Bennett

Patrick Bennett, With an exceptional h-index of 9 and a recent h-index of 8 (since 2020), a distinguished researcher at Western Michigan University, specializes in the field of probabilistic combinatorics.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the chromatic number of random regular hypergraphs

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

On the intersecting family process

Weighted tree games

Generalized Ramsey numbers at the linear and quadratic thresholds

Larger matchings and independent sets in regular uniform hypergraphs of high girth

Rainbow Greedy Matching Algorithms

On generalized Ramsey numbers in the non-integral regime

Patrick Bennett Information

University

Position

___

Citations(all)

230

Citations(since 2020)

141

Cited By

138

hIndex(all)

9

hIndex(since 2020)

8

i10Index(all)

9

i10Index(since 2020)

4

Email

University Profile Page

Google Scholar

Patrick Bennett Skills & Research Interests

probabilistic combinatorics

Top articles of Patrick Bennett

On the chromatic number of random regular hypergraphs

SIAM Journal on Discrete Mathematics

2024/6/30

Patrick Bennett
Patrick Bennett

H-Index: 5

Alan Frieze
Alan Frieze

H-Index: 36

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

arXiv preprint arXiv:2302.12358

2023/2/23

Patrick Bennett
Patrick Bennett

H-Index: 5

Calum Macrury
Calum Macrury

H-Index: 3

On the intersecting family process

arXiv preprint arXiv:2302.09050

2023/2/17

Weighted tree games

arXiv preprint arXiv:2311.11154

2023/11/18

Patrick Bennett
Patrick Bennett

H-Index: 5

Alan Frieze
Alan Frieze

H-Index: 36

Generalized Ramsey numbers at the linear and quadratic thresholds

arXiv preprint arXiv:2309.00182

2023/9/1

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

Larger matchings and independent sets in regular uniform hypergraphs of high girth

arXiv preprint arXiv:2307.15601

2023/7/28

Deepak Bal
Deepak Bal

H-Index: 6

Patrick Bennett
Patrick Bennett

H-Index: 5

Rainbow Greedy Matching Algorithms

arXiv preprint arXiv:2307.00657

2023/7/2

On generalized Ramsey numbers in the non-integral regime

arXiv preprint arXiv:2212.10542

2022/12/20

Patrick Bennett
Patrick Bennett

H-Index: 5

A random coloring process gives improved bounds for the Erd\H {o} s-Gy\'arf\'as problem on generalized Ramsey numbers

arXiv preprint arXiv:2212.06957

2022/12/14

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

A gentle introduction to the differential equation method and dynamic concentration

Discrete Mathematics

2022/12/1

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

A note on non-isomorphic edge-color classes in random graphs

arXiv e-prints

2022/10

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

The Erd\H{o}s-Gy\'arf\'as function -- so Gy\'arf\'as was right

arXiv preprint arXiv:2207.02920

2022/7/6

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

The Erdős-Gyárfás function -- so Gyárfás was right

arXiv e-prints

2022/7

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

On the number of alternating paths in random graphs

Discrete Applied Mathematics

2021/12/15

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

The set of ratios of derangements to permutations in digraphs is dense in

arXiv preprint arXiv:2101.02995

2021/1/8

Patrick Bennett
Patrick Bennett

H-Index: 5

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

SIAM Journal on Discrete Mathematics

2021

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

Zero-forcing in random regular graphs

Journal of Combinatorics

2021

Large triangle packings and Tuza’s conjecture in sparse random graphs

Combinatorics, Probability and Computing

2020/9

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

Alternating Connectivity in Random Graphs

2020

Patrick Bennett
Patrick Bennett

H-Index: 5

Andrzej Dudek
Andrzej Dudek

H-Index: 12

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

Combinatorics, Probability and Computing

2020/1

See List of Professors in Patrick Bennett University(Western Michigan University)

Co-Authors

academic-engine