 | 2012 |
| 14 |  | John Engbers,
David Galvin:
H-colouring bipartite graphs.
J. Comb. Theory, Ser. B 102(3): 726-742 (2012) |
| 13 |  | Peter Cholak,
David Galvin,
Reed Solomon:
Reverse mathematics and infinite traceable graphs.
Math. Log. Q. 58(1-2): 18-28 (2012) |
| 2011 |
| 12 |  | David Galvin:
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube.
Combinatorics, Probability & Computing 20(1): 27-51 (2011) |
| 11 |  | David Galvin:
Two problems on independent sets in graphs.
Discrete Mathematics 311(20): 2105-2112 (2011) |
| 10 |  | David Galvin,
Yufei Zhao:
The Number of Independent Sets in a Graph with Small Maximum Degree.
Graphs and Combinatorics 27(2): 177-186 (2011) |
| 9 |  | David Galvin,
Fabio Martinelli,
Kavita Ramanan,
Prasad Tetali:
The Multistate Hard Core Model on a Regular Tree.
SIAM J. Discrete Math. 25(2): 894-915 (2011) |
| 2009 |
| 8 |  | David Galvin:
An upper bound for the number of independent sets in regular graphs.
Discrete Mathematics 309(23-24): 6635-6640 (2009) |
| 7 |  | Teena Carroll,
David Galvin,
Prasad Tetali:
Matchings and independent sets of a fixed size in regular graphs.
J. Comb. Theory, Ser. A 116(7): 1219-1227 (2009) |
| 2008 |
| 6 |  | David Galvin:
Sampling independent sets in the discrete torus.
Random Struct. Algorithms 33(3): 356-376 (2008) |
| 2007 |
| 5 |  | David Galvin,
Dana Randall:
Torpid mixing of local Markov chains on 3-colorings of the discrete torus.
SODA 2007: 376-384 |
| 2006 |
| 4 |  | Raissa D'Souza,
David Galvin,
Cristopher Moore,
Dana Randall:
Global connectivity from local geometric constraints for sensor networks with various wireless footprints.
IPSN 2006: 19-26 |
| 3 |  | David Galvin,
Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs.
Random Struct. Algorithms 28(4): 427-443 (2006) |
| 2004 |
| 2 |  | David Galvin,
Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on the hypercube.
SODA 2004: 466-467 |
| 1 |  | David Galvin,
Jeff Kahn:
On Phase Transition in the Hard-Core Model on Math.
Combinatorics, Probability & Computing 13(2): 137-164 (2004) |