34 citations · 55 across the 3 of their papers we have counts for
4 papers
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…
Note on Counting Eulerian Circuits
Graham R. Brightwell, Peter Winkler
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
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…
General Covariance and the "Problem of Time" in a Discrete Cosmology
Graham Brightwell, H. Fay Dowker, Joe Henson +2
Identifying an appropriate set of ``observables'' is a nontrivial task for most approaches to quantum gravity. We describe how it may be accomplished in the context of a recently p…