34 citations · 55 across the 3 of their papers we have counts for
Showing 2004Show 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…
cs.CC2004★ 21 cited
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.