| Positional games D Hefetz, M Krivelevich, M Stojaković, T Szabó Birkhäuser, 2014 | 77 | 2014 |
| Anti‐magic graphs via the combinatorial nullstellensatz D Hefetz Journal of Graph Theory 50 (4), 263-272, 2005 | 68 | 2005 |
| Fast winning strategies in Maker–Breaker games D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series B 99 (1), 39-47, 2009 | 61 | 2009 |
| Avoider–Enforcer games D Hefetz, M Krivelevich, T Szabó Journal of Combinatorial Theory, Series A 114 (5), 840-853, 2007 | 46 | 2007 |
| Hamilton cycles in highly connected and expanding graphs D Hefetz, M Krivelevich, T Szabó Combinatorica 29 (5), 547-568, 2009 | 42 | 2009 |
| Planarity, colorability, and minor games D Hefetz, M Krivelevich, M Stojaković, T Szabó SIAM Journal on Discrete Mathematics 22 (1), 194-212, 2008 | 39 | 2008 |
| On antimagic directed graphs D Hefetz, T Mütze, J Schwartz Journal of Graph Theory 64 (3), 219-232, 2010 | 36 | 2010 |
| On two problems regarding the Hamiltonian cycle game D Hefetz, S Stich the electronic journal of combinatorics, R28-R28, 2009 | 35 | 2009 |
| Hitting time results for Maker‐Breaker games S Ben‐Shimon, A Ferber, D Hefetz, M Krivelevich Random Structures & Algorithms 41 (1), 23-46, 2012 | 32 | 2012 |
| Avoider–Enforcer: The rules of the game D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series A 117 (2), 152-163, 2010 | 31 | 2010 |
| Weak and strong -connectivity games A Ferber, D Hefetz European Journal of Combinatorics 35, 169-183, 2014 | 29 | 2014 |
| A hypergraph Turán theorem via lagrangians of intersecting families D Hefetz, P Keevash Journal of Combinatorial Theory, Series A 120 (8), 2020-2038, 2013 | 28 | 2013 |
| A sharp threshold for the Hamilton cycle Maker–Breaker game D Hefetz, M Krivelevich, M Stojaković, T Szabó Random Structures & Algorithms 34 (1), 112-122, 2009 | 25 | 2009 |
| Sharp threshold for the appearance of certain spanning trees in random graphs D Hefetz, M Krivelevich, T Szabó Random Structures & Algorithms 41 (4), 391-412, 2012 | 24 | 2012 |
| Winning strong games through fast strategies for weak games A Ferber, D Hefetz the electronic journal of combinatorics, P144-P144, 2011 | 23 | 2011 |
| An application of the Combinatorial Nullstellensatz to a graph labelling problem D Hefetz, A Saluz, HTT Tran Journal of Graph Theory 65 (1), 70-82, 2010 | 21 | 2010 |
| Random directed graphs are robustly Hamiltonian D Hefetz, A Steger, B Sudakov Random Structures & Algorithms 49 (2), 345-362, 2016 | 16 | 2016 |
| On two generalizations of the Alon–Tarsi polynomial method D Hefetz Journal of Combinatorial Theory, Series B 101 (6), 403-414, 2011 | 16 | 2011 |
| Global Maker–Breaker games on sparse graphs D Hefetz, M Krivelevich, M Stojaković, T Szabó European Journal of Combinatorics 32 (2), 162-177, 2011 | 15 | 2011 |
| On the inducibility of cycles D Hefetz, M Tyomkyn Journal of Combinatorial Theory, Series B 133, 243-258, 2018 | 13 | 2018 |
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerifierad e-postadress på post.tau.ac.il
