Metraipolis › archive › dc_ccb9a36c87f4
The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem — arXiv:2610.09650
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09650
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:44:02.198Z
- SHA-256 of the archived text
7d288cd73bfe1f6fe21d38e11b9d3fb87d8765f93bddfea8546408ae78a16452- Stable URL of this page
https://metraipolis.com/documento/dc_ccb9a36c87f4
How to cite
The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem — arXiv:2610.09650 — arXiv (en), https://arxiv.org/abs/2610.09650 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccb9a36c87f4 (Metraipolis archive dc_ccb9a36c87f4, sha256 7d288cd73bfe1f6fe21d38e11b9d3fb87d8765f93bddfea8546408ae78a16452)
BibTeX
@misc{dcccb9a36c87f4,
title = {The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem — arXiv:2610.09650},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09650},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccb9a36c87f4; sha256 7d288cd73bfe1f6fe21d38e11b9d3fb87d8765f93bddfea8546408ae78a16452},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09650. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study two graph pebbling parameters, the stacking number and the clearing number, through the Almost Stacked Hypothesis (ASH). This hypothesis asserts that these thresholds can be determined by testing only configurations in which at most one vertex carries more than one pebble. We prove that every almost stacked configuration of size $2^{n+1}-1$ on $C_{2n}$ is stackable and that every almost stacked configuration of size $3\cdot 2^n-2$ on $C_{2n+1}$ is clearable. Together with the known lower bounds, these results show that ASH implies $\operatorname{stack}(C_{2n})=2^{n+1}-1$ and $\operatorname{clear}(C_{2n+1})=3\cdot 2^n-2$. For a finite tree $T$, we introduce an explicit invariant $\operatorname{estim}(T)$. We prove unconditionally that $\operatorname{stack}(T)\geq\operatorname{estim}(T)$ and prove the reverse inequality under ASH. Consequently, ASH yields $\operatorname{stack}(T)=\operatorname{estim}(T)$, and we conjecture that this equality holds unconditionally. Finally, we study perfectly pebblable graphs: finite connected non-bipartite graphs whose clearing number has the minimum possible value $\operatorname{clear}(G)=|V(G)|+1$. Every complete graph with at least three vertices is perfectly pebblable, which might suggest that perfect pebblability requires high edge density. Assuming ASH, however, we show that this is not the case. We give a sufficient criterion involving strong edge-triangulation and Hamiltonian-path and path-cover conditions in vertex-deleted subgraphs and use it to construct two explicit infinite families of perfectly pebblable graphs with edge density tending to zero, one of which has only a linear number of edges.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.09650 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:00.189Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).