Thresholds for families of multisets, with an application to graph pebbling
Combinatorics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0406068,
title = {Thresholds for families of multisets, with an application to graph pebbling},
author = {Airat Bekmetjev and Graham Brightwell and Andrzej Czygrinow and Glenn Hurlbert},
journal= {arXiv preprint arXiv:math/0406068},
year = {2007}
}
Comments
17 pages