Thresholds for families of multisets, with an application to graph pebbling

Simple item page
dc.creatorBekmetjev, Airat
dc.creatorBrightwell, Graham
dc.creatorCzygrinow, Andrzej
dc.creatorHurlbert, Glenn
dc.date2004-06-03
dc.date.accessioned2026-07-07T05:08:51Z
dc.date.available2026-07-07T05:08:51Z
dc.descriptionIn 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/math/0406068
dc.identifierhttp://arxiv.org/abs/math/0406068
dc.identifierDiscrete Math. 269 (2003), no.1-3, 21--34
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71430
dc.subjectCombinatorics
dc.subject05D05, 05C35, 05A20
dc.titleThresholds for families of multisets, with an application to graph pebbling
dc.typetext

Files

Collections

arXiv