| On phase transition in the hard-core model on D Galvin, J Kahn Combinatorics, Probability and Computing 13 (2), 137-164, 2004 | 105 | 2004 |
| On Weighted Graph Homomorphisms. D Galvin, P Tetali DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63 …, 2004 | 102 | 2004 |
| Three tutorial lectures on entropy and counting D Galvin arXiv preprint arXiv:1406.7872, 2014 | 76 | 2014 |
| On homomorphisms from the Hamming cube to Z D Galvin Israel Journal of Mathematics 138 (1), 189-213, 2003 | 62 | 2003 |
| Two problems on independent sets in graphs D Galvin Discrete Mathematics 311 (20), 2105-2112, 2011 | 56 | 2011 |
| Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs D Galvin, P Tetali Random Structures & Algorithms 28 (4), 427-443, 2006 | 52 | 2006 |
| Cutting lemma and Zarankiewicz’s problem in distal structures A Chernikov, D Galvin, S Starchenko Selecta Mathematica 26 (2), 25, 2020 | 47 | 2020 |
| Counting independent sets of a fixed size in graphs with a given minimum degree J Engbers, D Galvin Journal of Graph Theory 76 (2), 149-168, 2014 | 42 | 2014 |
| Matchings and independent sets of a fixed size in regular graphs T Carroll, D Galvin, P Tetali Journal of Combinatorial Theory, Series A 116 (7), 1219-1227, 2009 | 33 | 2009 |
| Torpid mixing of local Markov chains on 3-colorings of the discrete torus D Galvin, D Randall arXiv preprint arXiv:1206.3193, 2012 | 29 | 2012 |
| The multistate hard core model on a regular tree D Galvin, F Martinelli, K Ramanan, P Tetali SIAM Journal on Discrete Mathematics 25 (2), 894-915, 2011 | 29 | 2011 |
| A threshold phenomenon for random independent sets in the discrete hypercube D Galvin Combinatorics, probability and computing 20 (1), 27-51, 2011 | 29 | 2011 |
| Independent sets in the discrete hypercube D Galvin arXiv preprint arXiv:1901.01991, 2019 | 28 | 2019 |
| H-coloring tori J Engbers, D Galvin Journal of Combinatorial Theory, Series B 102 (5), 1110-1133, 2012 | 27 | 2012 |
| Stirling numbers of forests and cycles DT Thanh, D Galvin arXiv preprint arXiv:1206.3591, 2012 | 27 | 2012 |
| Global connectivity from local geometric constraints for sensor networks with various wireless footprints R d'Souza, D Galvin, C Moore, D Randall Proceedings of the 5th international conference on Information processing in …, 2006 | 27 | 2006 |
| Restricted Stirling and Lah number matrices and their inverses J Engbers, D Galvin, C Smyth Journal of Combinatorial Theory, Series A 161, 271-298, 2019 | 25 | 2019 |
| Phase coexistence and torpid mixing in the 3-coloring model on D Galvin, J Kahn, D Randall, GB Sorkin SIAM Journal on Discrete Mathematics 29 (3), 1223-1244, 2015 | 24 | 2015 |
| Phase Coexistence for the Hard-Core Model on ℤ2 A Blanca, Y Chen, D Galvin, D Randall, P Tetali Combinatorics, Probability and Computing 28 (1), 1-22, 2019 | 23* | 2019 |
| Maximizing H‐Colorings of a Regular Graph D Galvin Journal of Graph Theory 73 (1), 66-84, 2013 | 23 | 2013 |
Prasad TetaliHead, Department of Mathematical Sciences, Carnegie Mellon UniversityVerified email at andrew.cmu.edu
