2004/06/03 by Airat Bekmetjev, Graham Brightwell, Andrzej Czygrinow +1
Mathematics · #math.CO #msc:05D05 #msc:05C35 #msc:05A20
published as Discrete Math. 269 (2003), no.1-3, 21--34 · 17 pages
arxiv created 2004/06/03 · arxiv updated 2009/12/01
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-Thomason threshold result. As a corollary we obtain the existence of pebbling thresholds for arbitrary graph sequences. In addition, we improve both the lower and upper bounds for the `random pebbling' threshold of the sequence of paths.