default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Bennett
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Alan M. Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden:
On the Intersecting Family Process. Electron. J. Comb. 31(4) (2024)- [j26]Patrick Bennett, Ryan Cushman, Andrzej Dudek
, Elizabeth Sprangel:
A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. Graphs Comb. 40(6): 126 (2024) - [j25]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: 253-297 (2024) - [j24]Patrick Bennett, Alan M. Frieze:
On the Chromatic Number of Random Regular Hypergraphs. SIAM J. Discret. Math. 38(2): 1369-1380 (2024) - 2023
- [j23]Deepak Bal, Patrick Bennett:
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Electron. J. Comb. 30(1) (2023) - [i3]Patrick Bennett, Calum MacRury:
Extending Wormald's Differential Equation Method to One-sided Bounds. CoRR abs/2302.12358 (2023) - 2022
- [j22]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) - [j21]Patrick Bennett, Andrzej Dudek:
A gentle introduction to the differential equation method and dynamic concentration. Discret. Math. 345(12): 113071 (2022) - 2021
- [j20]Patrick Bennett, Ryan Cushman, Andrzej Dudek:
On the number of alternating paths in random graphs. Discret. Appl. Math. 304: 84-97 (2021) - [j19]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): 2145-2169 (2021) - 2020
- [j18]Patrick Bennett:
The Sum-Free Process. Electron. J. Comb. 27(1): 1 (2020) - [j17]Deepak Bal, Patrick Bennett:
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. Electron. J. Comb. 27(4): 4 (2020) - [j16]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): 44-67 (2020) - [j15]Patrick Bennett, Andrzej Dudek, Shira Zerbib:
Large triangle packings and Tuza's conjecture in sparse random graphs. Comb. Probab. Comput. 29(5): 757-779 (2020)
2010 – 2019
- 2019
- [j14]Patrick Bennett, Tom Bohman:
A natural barrier in random greedy hypergraph matching. Comb. Probab. Comput. 28(6): 816-825 (2019) - [j13]Patrick Bennett, Sean English, Maria Talanda-Fisher:
Weighted Turán problems with applications. Discret. Math. 342(8): 2165-2172 (2019) - [j12]Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English:
Large monochromatic components and long monochromatic cycles in random hypergraphs. Eur. J. Comb. 76: 123-137 (2019) - 2018
- [j11]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): 449-481 (2018) - 2017
- [j10]Patrick Bennett, Andrzej Dudek, Elliot Laforge:
On the Number of Alternating Paths in Bipartite Complete Graphs. Graphs Comb. 33(2): 307-320 (2017) - [j9]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - [j8]Patrick Bennett, Andrzej Dudek:
On the Ramsey-Turán number with small s-independence number. J. Comb. Theory B 122: 690-718 (2017) - [j7]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): 587-606 (2017) - 2016
- [j6]Deepak Bal, Patrick Bennett, Andrzej Dudek, Pawel Pralat:
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j5]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): 2 (2016) - [j4]Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat:
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83(3): 251-265 (2016) - [j3]Patrick Bennett, Tom Bohman:
A note on the random greedy independent set algorithm. Random Struct. Algorithms 49(3): 479-502 (2016) - 2015
- [j2]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): 1 (2015) - [i2]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - 2014
- [j1]Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze:
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30(5): 1073-1086 (2014) - 2012
- [i1]Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. CoRR abs/1209.6570 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
