Patrick Bennett
Patrick Bennett
Verified email at wmich.edu
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
262016
On integer-magic spectra of caterpillars
E Salehi, P Bennett
Journal of Combinatorial Mathematics and Combinatorial Computing 61, 65, 2007
172007
A natural barrier in random greedy hypergraph matching
P Bennett, T Bohman
Combinatorics, Probability and Computing 28 (6), 816-825, 2019
142019
Adding random edges to create the square of a Hamilton cycle
P Bennett, A Dudek, A Frieze
arXiv preprint arXiv:1710.02716, 2017
122017
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
112015
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
72016
The total acquisition number of random graphs
D Bal, P Bennett, A Dudek, P Prałat
arXiv preprint arXiv:1402.2854, 2014
62014
Integer-Magic Spectra of Trees of Diameter Five
E Salehi, P Bennett
Journal of Combinatorial Mathematics and Combinatorial Computing 66, 105-111, 2008
62008
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
52020
Square of a Hamilton cycle in a random graph
P Bennett, A Dudek, A Frieze
arXiv preprint arXiv:1611.06570, 2016
52016
The t-tone chromatic number of random graphs
D Bal, P Bennett, A Dudek, A Frieze
Graphs and Combinatorics 30 (5), 1073-1086, 2014
52014
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
42019
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
42017
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
32020
Power of choices and rainbow spanning trees in random graphs
D Bal, P Bennett, A Frieze, P Prałat
arXiv preprint arXiv:1410.3405, 2014
32014
Zero forcing number of random regular graphs
D Bal, P Bennett, S English, C MacRury, P Prałat
arXiv preprint arXiv:1812.06477, 2018
22018
On the Ramsey–Turán number with small s-independence number
P Bennett, A Dudek
Journal of Combinatorial Theory, Series B 122, 690-718, 2017
22017
The 1-2-3 conjecture for uniform hypergraphs
P BENNETT, A DUDEK, A FRIEZE, L HELENIUS
arXiv preprint arXiv:1511.04569, 2015
22015
Adding random edges to create the square of a Hamilton cycle (2017), available at
P Bennett, A Dudek, A Frieze
arXiv preprint arXiv:1710.02716, 0
2
The bipartite -free process and bipartite Ramsey number
D Bal, P Bennett
arXiv preprint arXiv:1808.02139, 2018
12018
The system can't perform the operation now. Try again later.
Articles 1–20