3 papers
math.LO2010
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…
math.CO2010
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…
math.PR2010
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…