arXiv (All)
open access
The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem
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 eve
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Monochromatic cycle partitions in 3-mean edge-colourings#1326368
- On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor#1105043
- FPT Isomorphism Test for $F$-Free Tournaments#1051205
- More (shifted) runners, less loneliness#1050141
- On the number of edges of restricted matchstick graphs#1327233
Record · ID 1234018
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive