Patrick Bennett

Cited by

	All	Since 2020
Citations	311	211
h-index	11	8
i10-index	11	7

20072008200920102011201220132014201520162017201820192020202120222023202420252 4 2 2 2 2 5 1 14 15 16 17 12 26 29 38 31 72 15

Public access

View all

8 articles

1 article

available

not available

Based on funding mandates

Co-authors

Andrzej DudekWestern Michigan UniversityVerified email at wmich.edu
Deepak BalMontclair State UniversityVerified email at montclair.edu
Alan FriezeCarnegie Mellon UniversityVerified email at random.math.cmu.edu
Pawel PralatToronto Metropolitan UniversityVerified email at torontomu.ca
Sean EnglishUniversity of North Carolina WilmingtonVerified email at uncw.edu
Tom BohmanCarnegie Mellon UniversityVerified email at math.cmu.edu
Shira ZerbibIowa State UniversityVerified email at iastate.edu
Ebrahim SalehiProfessor of Mathematics, University of Nevada Las VegasVerified email at unlv.edu
Calum MacRuryColumbia Business SchoolVerified email at columbia.edu
Colin CooperProfessor in Computer Science, King's College LondonVerified email at kcl.ac.uk
Paul WollanProfessor of Computer Science, University of Rome La SapienzaVerified email at di.uniroma1.it
Tony HuynhDepartment of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Ilario BonacinaUniversitat Politècnica de CatalunyaVerified email at cs.upc.edu
Nicola GalesiSapienza University RomeVerified email at uniroma1.it
Xavier Pérez-GiménezUniversity of Nebraska-LincolnVerified email at unl.edu
Oleg PikhurkoUniversity of WarwickVerified email at warwick.ac.uk
Bernard LidickýProfessor, Iowa State UniversityVerified email at iastate.edu
Louis DeBiasioMiami UniversityVerified email at miamioh.edu

Patrick Bennett

Western Michigan University

Verified email at wmich.edu - Homepage

probabilistic and extremal combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A note on the random greedy independent set algorithm P Bennett, T Bohman Random Structures & Algorithms 49 (3), 479-502, 2016	35	2016
A natural barrier in random greedy hypergraph matching P Bennett, T Bohman Combinatorics, Probability and Computing 28 (6), 816-825, 2019	23	2019
On integer-magic spectra of caterpillars E Salehi, P Bennett Journal of Combinatorial Mathematics and Combinatorial Computing 61, 65, 2007	23	2007
A gentle introduction to the differential equation method and dynamic concentration P Bennett, A Dudek Discrete Mathematics 345 (12), 113071, 2022	22	2022
Space proof complexity for random 3-CNFs P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan Information and Computation 255, 165-176, 2017	18	2017
Weighted Turán problems with applications P Bennett, S English, M Talanda-Fisher Discrete Mathematics 342 (8), 2165-2172, 2019	15	2019
Rainbow perfect matchings and Hamilton cycles in the random geometric graph D Bal, P Bennett, X Pérez‐Giménez, P Prałat Random Structures & Algorithms 51 (4), 587-606, 2017	13	2017
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs P Bennett, A Dudek, A Frieze, L Helenius arXiv preprint arXiv:1511.04569, 2015	13	2015
The t-Tone Chromatic Number of Random Graphs D Bal, P Bennett, A Dudek, A Frieze Graphs and Combinatorics 30, 1073-1086, 2014	12	2014
Edge-coloring a graph so that every copy of a graph has an odd color class P Bennett, E Heath, S Zerbib arXiv preprint arXiv:2307.01314, 2023	11	2023
P. Pra lat. The Erdos-Gyárfás function f (n, 4, 5)= 5 6 n+ o (n)–so Gyárfás was right P Bennett, R Cushman, A Dudek arXiv preprint arXiv:2207.02920, 2022	11*	2022
Minimizing the number of 5-cycles in graphs with given edge-density P Bennett, A Dudek, B Lidický, O Pikhurko Combinatorics, Probability and Computing 29 (1), 44-67, 2020	9	2020
Large monochromatic components and long monochromatic cycles in random hypergraphs P Bennett, L DeBiasio, A Dudek, S English European Journal of Combinatorics 76, 123-137, 2019	9	2019
Integer-magic spectra of trees of diameter Five E Salehi, P Bennett Journal of Combinatorial Mathematics and Combinatorial Computing 66, 105-111, 2008	9	2008
Large triangle packings and Tuza’s conjecture in sparse random graphs P Bennett, A Dudek, S Zerbib Combinatorics, Probability and Computing 29 (5), 757-779, 2020	8	2020
Rainbow arborescence in random digraphs D Bal, P Bennett, C Cooper, A Frieze, P Prałat Journal of Graph Theory 83 (3), 251-265, 2016	8	2016
A random coloring process gives improved bounds for the Erd\H {o} s-Gy\'arf\'as problem on generalized Ramsey numbers P Bennett, A Dudek, S English arXiv preprint arXiv:2212.06957, 2022	7	2022
The total acquisition number of random graphs D Bal, P Bennett, A Dudek, P Prałat arXiv preprint arXiv:1402.2854, 2014	7	2014
Extending Wormald’s differential equation method to one-sided bounds P Bennett, C MacRury Combinatorics, Probability and Computing, 1-14, 2024	5	2024
Zero-forcing in random regular graphs D Bal, P Bennett, S English, C MacRury, P Prałat Journal of Combinatorics 12 (1), 85-116, 2021	5	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors