2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/71430In 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.17 pagesCombinatorics05D05, 05C35, 05A20text