arXiv (All)
open access
A Fixed-Offset Transition for Random Stackability on Paths
We study a support-collapse version of graph pebbling on paths. A configuration is stackable if a sequence of legal pebbling moves can produce a nonzero configuration supported on a single vertex. On the path P_n, we choose a configuration uniformly from all weak compositions of total n times mu_n,
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
- Stability of Flow Models for Graph Signals#349633
- Hamiltonian paths in the permutation digraphs $P(n,n-2)$#615262
- Hamiltonian paths in the permutation digraphs $P(n,n-2)$#614295
- On the matching complexes of categorical product of path graphs#160800
- $λ$-matchability in cubic graphs#798607
Record · ID 1144600
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