32 citations · 91 across the 36 of their papers we have counts for
Showing 2010 · math.COShow all
3 papers · 2 filters
math.CO2010
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…
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.CO2010★ 19 cited
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…