| A note on the random greedy independent set algorithm P Bennett, T Bohman Random Structures & Algorithms 49 (3), 479-502, 2016 | 32 | 2016 |
| On integer-magic spectra of caterpillars E Salehi, P Bennett Journal of Combinatorial Mathematics and Combinatorial Computing 61, 65, 2007 | 22 | 2007 |
| A natural barrier in random greedy hypergraph matching P Bennett, T Bohman Combinatorics, Probability and Computing 28 (6), 816-825, 2019 | 21 | 2019 |
| 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 | 20 | 2017 |
| A gentle introduction to the differential equation method and dynamic concentration P Bennett, A Dudek Discrete Mathematics 345 (12), 113071, 2022 | 14 | 2022 |
| Weighted Turán problems with applications P Bennett, S English, M Talanda-Fisher Discrete Mathematics 342 (8), 2165-2172, 2019 | 13 | 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 | 12 | 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 | 12 | 2015 |
| The t-Tone Chromatic Number of Random Graphs D Bal, P Bennett, A Dudek, A Frieze Graphs and Combinatorics 30, 1073-1086, 2014 | 11 | 2014 |
| 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 |
| 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 | 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 |
| 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 | 7 | 2023 |
| 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 | 7 | 2020 |
| The total acquisition number of random graphs D Bal, P Bennett, A Dudek, P Prałat arXiv preprint arXiv:1402.2854, 2014 | 7 | 2014 |
| The Erdős-Gyárfás function f (n, 4, 5)= 56n+ o (n)—So Gyárfás was right P Bennett, R Cushman, A Dudek, P Prałat Journal of Combinatorial Theory, Series B 169, 253-297, 2024 | 6 | 2024 |
| 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 | 5 | 2022 |
| 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 | 5 | 2014 |
| 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 | 4 | 2021 |
Andrzej DudekWestern Michigan University在 wmich.edu 的电子邮件经过验证
