32 citations · 91 across the 36 of their papers we have counts for
5 papers · 1 filter
Reverse mathematics and infinite traceable graphs
Peter Cholak, David Galvin, Reed Solomon
This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions o…
Sampling independent sets in the discrete torus
David Galvin
The even discrete torus is the graph T_{L,d} on vertex set {0,...,L-1}^d (L even) with two vertices adjacent if they differ by 1 (mod L) on one coordinate. The hard-core measure wi…
An upper bound for the number of independent sets in regular graphs
David Galvin
Write for the set of independent sets of a graph and for . It has been conjectured (by Alon and Kahn) that for an -vertex, -regular gr…
The multi-state hard core model on a regular tree
David Galvin, Fabio Martinelli, Kavita Ramanan +1
The classical hard core model from statistical physics, with activity and capacity , on a graph , concerns a probability measure on the set of inde…
The number of independent sets in a graph with small maximum degree
David Galvin, Yufei Zhao
Let be the number of independent sets in a graph . We show that if has maximum degree at most then $$ {\rm ind}(G) \leq 2^{{\rm iso}(G)} \prod_{uv \in E(G…