34 citations · 55 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2004
Thresholds for families of multisets, with an application to graph pebbling
Airat Bekmetjev, Graham Brightwell, Andrzej Czygrinow +1
In this paper we prove two multiset analogs of classical results. We prove a multiset analog of Lovasz's version of the Kruskal-Katona Theorem and an analog of the Bollobas-Thomaso…
math.CO2003★ 34 cited
Hard constraints and the bethe lattice: adventures at the interface of combinatorics and statistical physics
Graham R. Brightwell, Peter Winkler
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discre…