Personal information

Emails & domains

Verified email domains

Other IDs

Scopus Author ID: 36805521500

Activities

Collapse all

Employment (1)

Western Michigan University: Kalamazoo, Michigan, US

2015-08 to present | Associate Professor (Mathematics)
Employment
Source: Self-asserted source
Patrick Bennett

Education and qualifications (1)

Carnegie Mellon University: Pittsburgh, US

2013-05 | Ph.D. (Mathematics)
Education
Source: Self-asserted source
Patrick Bennett

Funding (3)

6th Lake Michigan Workshops on Combinatorics and Graph Theory

2019-03-15 to 2020-02-29 | Grant
Directorate for Mathematical & Physical Sciences (Alexandria, US)
URL: https://app.dimensions.ai/details/grant/grant.7923336
GRANT_NUMBER: 1855680
Source: Self-asserted source
Patrick Bennett via DimensionsWizard

5th Lake Michigan Workshop on Combinatorics and Graph Theory

2018-01-01 to 2018-12-31 | Grant
Directorate for Mathematical & Physical Sciences (Alexandria, US)
URL: https://app.dimensions.ai/details/grant/grant.7160582
GRANT_NUMBER: 1762078
Source: Self-asserted source
Patrick Bennett via DimensionsWizard

The 4th Lake Michigan Workshop on Combinatorics and Graph Theory

2017-04-01 to 2018-03-31 | Grant
Directorate for Mathematical & Physical Sciences (Alexandria, US)
URL: https://app.dimensions.ai/details/grant/grant.6934545
GRANT_NUMBER: 1664943
Source: Self-asserted source
Patrick Bennett via DimensionsWizard

Works (29)

Some online Maker-Breaker games

Discrete Mathematics
2025-06 | Journal article
DOI: 10.1016/j.disc.2025.114446
Contributors: Patrick Bennett; Alan Frieze
Source: check_circle
Crossref

Extending Wormald’s differential equation method to one-sided bounds

Combinatorics, Probability and Computing
2025-02-06 | Journal article
DOI: 10.1017/S0963548325000033
Contributors: Patrick Bennett; Calum MacRury
Source: check_circle
Crossref

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

Electronic Journal of Combinatorics
2023 | Journal article
DOI: 10.37236/10698
EID:

2-s2.0-85146128564

Part of ISSN: 10778926
Contributors: Bal, D.; Bennett, P.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

A gentle introduction to the differential equation method and dynamic concentration

Discrete Math.
2022 | Journal article
DOI: 10.1016/j.disc.2022.113071
Part of ISSN: 0012-365X
Contributors: Bennett, Patrick; Dudek, Andrzej
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

The set of ratios of derangements to permutations in digraphs is dense in $[0,1/2]$

Electron. J. Combin.
2022 | Journal article
DOI: 10.37236/10293
Contributors: Austhof, Bethany; Bennett, Patrick; Christo, Nick
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Closing the random graph gap in Tuza's conjecture through the online triangle packing process

SIAM J. Discrete Math.
2021 | Journal article
DOI: 10.1137/20M1351771
Part of ISSN: 0895-4801
Contributors: Bennett, Patrick; Cushman, Ryan; Dudek, Andrzej
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

On the number of alternating paths in random graphs

Discrete Appl. Math.
2021 | Journal article
DOI: 10.1016/j.dam.2021.07.027
Part of ISSN: 0166-218X
Contributors: Bennett, Patrick; Cushman, Ryan; Dudek, Andrzej
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Zero-forcing in random regular graphs

J. Comb.
2021 | Journal article
DOI: 10.4310/JOC.2021.v12.n1.a4
Part of ISSN: 2156-3527
Contributors: Bal, Deepak; Bennett, Patrick; English, Sean; MacRury, Calum; Prał at, Paweł
Source: Self-asserted source
Patrick Bennett

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

Combin. Probab. Comput.
2020 | Journal article
DOI: 10.1017/s0963548320000115
Part of ISSN: 0963-5483
Contributors: Bennett, Patrick; Dudek, Andrzej; Zerbib, Shira
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

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

Combin. Probab. Comput.
2020 | Journal article
DOI: 10.1017/s0963548319000257
Part of ISSN: 0963-5483
Contributors: Bennett, Patrick; Dudek, Andrzej; Lidický, Bernard; Pikhurko, Oleg
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

The bipartite $K_2,2$-free process and bipartite Ramsey number $b(2, t)$

Electron. J. Combin.
2020 | Journal article
DOI: 10.37236/9101
Contributors: Bal, Deepak; Bennett, Patrick
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

The sum-free process

Electronic Journal of Combinatorics
2020 | Journal article
DOI: 10.37236/8095
EID:

2-s2.0-85078863955

Part of ISSN: 10778926
Contributors: Bennett, P.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

The sum-free process

Electron. J. Combin.
2020 | Journal article
Contributors: Bennett, Patrick
Source: Self-asserted source
Patrick Bennett

A natural barrier in random greedy hypergraph matching

Combin. Probab. Comput.
2019 | Journal article
DOI: 10.1017/s0963548319000051
Part of ISSN: 0963-5483
Contributors: Bennett, Patrick; Bohman, Tom
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Large monochromatic components and long monochromatic cycles in random hypergraphs

European J. Combin.
2019 | Journal article
DOI: 10.1016/j.ejc.2018.10.001
Part of ISSN: 0195-6698
Contributors: Bennett, Patrick; DeBiasio, Louis; Dudek, Andrzej; English, Sean
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Weighted Turán problems with applications

Discrete Math.
2019 | Journal article
DOI: 10.1016/j.disc.2019.04.007
Part of ISSN: 0012-365X
Contributors: Bennett, Patrick; English, Sean; Tal; a-Fisher, Maria
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

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

J. Graph Theory
2018 | Journal article
DOI: 10.1002/jgt.22224
Part of ISSN: 0364-9024
Contributors: Bal, Deepak; Bennett, Patrick; Bohman, Tom; Frieze, Alan
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

On the number of alternating paths in bipartite complete graphs

Graphs Combin.
2017 | Journal article
DOI: 10.1007/s00373-017-1771-x
Part of ISSN: 0911-0119
Contributors: Bennett, Patrick; Dudek, Andrzej; Laforge, Elliot
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

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

J. Combin. Theory Ser. B
2017 | Journal article
DOI: 10.1016/j.jctb.2016.09.002
Part of ISSN: 0095-8956
Contributors: Bennett, Patrick; Dudek, Andrzej
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Rainbow perfect matchings and Hamilton cycles in the random geometric graph

Random Structures Algorithms
2017 | Journal article
DOI: 10.1002/rsa.20717
Part of ISSN: 1042-9832
Contributors: Bal, Deepak; Bennett, Patrick; Pérez-Giménez, Xavier; Prał at, Paweł
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Space proof complexity for random 3-CNFs

Inform. and Comput.
2017 | Journal article
DOI: 10.1016/j.ic.2017.06.003
Part of ISSN: 0890-5401
Contributors: Bennett, Patrick; Bonacina, Ilario; Galesi, Nicola; Huynh, Tony; Molloy, Mike; Wollan, Paul
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

A note on the random greedy independent set algorithm

Random Structures Algorithms
2016 | Journal article
DOI: 10.1002/rsa.20667
Part of ISSN: 1042-9832
Contributors: Bennett, Patrick; Bohman, Tom
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Rainbow arborescence in random digraphs

J. Graph Theory
2016 | Journal article
DOI: 10.1002/jgt.21995
Part of ISSN: 0364-9024
Contributors: Bal, Deepak; Bennett, Patrick; Cooper, Colin; Frieze, Alan; Prał at, Paweł
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

The total acquisition number of random graphs

Electron. J. Combin.
2016 | Journal article
DOI: 10.37236/5327
Contributors: Bal, Deepak; Bennett, Patrick; Dudek, Andrzej; Prał at, Paweł
Source: Self-asserted source
Patrick Bennett
grade
Preferred source (of 2)‎

Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs

Electronic Journal of Combinatorics
2016 | Journal article
DOI: 10.37236/5709
EID:

2-s2.0-84976277556

Part of ISSN: 10778926
Contributors: Bennett, P.; Dudek, A.; Frieze, A.; Helenius, L.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

Power of k choices and rainbow spanning trees in random graphs

Electronic Journal of Combinatorics
2015 | Journal article
DOI: 10.37236/4642
EID:

2-s2.0-84922983840

Part of ISSN: 10778926
Contributors: Bal, D.; Bennett, P.; Frieze, A.; Prałat, P.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

The t-Tone Chromatic Number of Random Graphs

Graphs and Combinatorics
2014 | Journal article
DOI: 10.1007/s00373-013-1341-9
EID:

2-s2.0-84906345851

Part of ISSN: 09110119
Contributors: Bal, D.; Bennett, P.; Dudek, A.; Frieze, A.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

Integer-magic spectra of trees of diameter five

Journal of Combinatorial Mathematics and Combinatorial Computing
2008 | Journal article
EID:

2-s2.0-78651525604

Part of ISSN: 08353026
Contributors: Salehi, E.; Bennett, P.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier

On integer-magic spectra of caterpillars

Journal of Combinatorial Mathematics and Combinatorial Computing
2007 | Journal article
EID:

2-s2.0-70349440182

Part of ISSN: 08353026
Contributors: Salehi, E.; Bennett, P.
Source: Self-asserted source
Patrick Bennett via Scopus - Elsevier
How many people are using ORCID?