David Galvin
David Galvin
Associate Professor of Mathematics, University of Notre Dame
Verified email at nd.edu - Homepage
Title
Cited by
Cited by
Year
On weighted graph homomorphisms
D Galvin, P Tetali
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63 …, 2004
762004
On phase transition in the hard-core model on
D Galvin, J Kahn
arXiv preprint arXiv:1206.3144, 2012
662012
On homomorphisms from the Hamming cube to Z
D Galvin
Israel Journal of Mathematics 138 (1), 189-213, 2003
432003
Two problems on independent sets in graphs
D Galvin
Discrete Mathematics 311 (20), 2105-2112, 2011
422011
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
302009
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
292014
Three tutorial lectures on entropy and counting
D Galvin
arXiv preprint arXiv:1406.7872, 2014
282014
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
272006
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
D Galvin, D Randall
arXiv preprint arXiv:1206.3193, 2012
252012
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
242006
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
202015
Stirling numbers of forests and cycles
DT Thanh, D Galvin
arXiv preprint arXiv:1206.3591, 2012
202012
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2
A Blanca, D Galvin, D Randall, P Tetali
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
192013
H-coloring tori
J Engbers, D Galvin
Journal of Combinatorial Theory, Series B 102 (5), 1110-1133, 2012
182012
An upper bound for the number of independent sets in regular graphs
D Galvin
Discrete mathematics 309 (23-24), 6635-6640, 2009
182009
Sampling independent sets in the discrete torus
D Galvin
Random Structures & Algorithms 33 (3), 356-376, 2008
182008
Maximizing H‐Colorings of a Regular Graph
D Galvin
Journal of Graph Theory 73 (1), 66-84, 2013
172013
The number of independent sets in a graph with small maximum degree
D Galvin, Y Zhao
Graphs and Combinatorics 27 (2), 177-186, 2011
152011
Phase Coexistence for the Hard-Core Model on
A Blanca, Y Chen, D Galvin, D Randall, P Tetali
arXiv preprint arXiv:1611.01115, 2016
14*2016
Combinatorially interpreting generalized Stirling numbers
J Engbers, D Galvin, J Hilyard
European Journal of Combinatorics 43, 32-54, 2015
142015
The system can't perform the operation now. Try again later.
Articles 1–20