David Galvin
Associate Professor
B.A., Peterhouse, University of Cambridge, 1995
Ph.D., Rutgers University, 2002
Email: dgalvin1@nd.edu
Office: 132 HayesHealy
Phone: (574) 6314181
Fax: (574) 6316579
For additional information see David Galvin’s Personal Page.
Research Interests
My research is in discrete probability, combinatorics and graph theory; in particular, the applications of combinatorial ideas to the study of phase transitions in statistical physics models, the efficiency of algorithms in theoretical computer science, and longrange correlations in discrete random structures.
Selected Publications

J. Engbers and D. Galvin, Extremal Hcolorings of trees and 2connected graphs, J. Combin. Theory Ser. B 122 (2017), 800–814.

D. Galvin, J. Kahn, D. Randall and G. Sorkin, Phase coexistence and torpid mixing in the 3coloring model on Zd, SIAM J. Discrete Math. 29 (2015), 1223–1244.

J. Engbers, D. Galvin and J. Hilyard, Combinatorially interpreting generalized Stirling numbers, European J. Combin. 43 (2015), 32–54.

J. Engbers and D. Galvin, Counting independent sets of a fixed size in graphs with a given minimum degree, J. Graph Theory 76 (2014), 149–168.

D. Galvin, Maximizing Hcolorings of regular graphs, J. Graph Theory 73 (2013), 66–84.
Please direct questions and comments to: dgalvin1@nd.edu