The Almost Stacked Hypothesis: A Conjectural Analogue of Sj\"ostrand's Cover Pebbling Theorem 628KM8869P
| URI | m2://res/628KM8869P |
|---|---|
| Kind | preprint |
| Creators | Tamás Csernák, Lajos Soukup |
| Date | 2026-10-07 |
| MSC | 05-XX |
| Subjects | arxiv math.CO |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-10-07 |
| Ids | arXiv 2610.09650, zbl_id 903202196 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Pullback Lemma | statement | lemma 4.8 | arxiv |
| 2PBCC8A0EM | definition | definition 6.3 | arxiv |
| Tree lower bound | statement | theorem 5.2 | arxiv |
| Odd-cycle clearing lower bound, {*{Corollary 6.3 | statement | corollary 4.6 | arxiv |
| 3ZEAPX2MDS | definition | definition 6.7 | arxiv |
| Monotonicity above the order | statement | lemma 4.7 | arxiv |
| 6A6JDEBZQ0 | statement | lemma 6.4 | arxiv |
| Almost stacked configurations on odd cycles | statement | theorem 4.11 | arxiv |
| 72P5JZQ5MX | statement | corollary 6.5 | arxiv |
| Tree consequence of ASH | statement | theorem 5.4 | arxiv |
| 7M4E76ZRSA | statement | proposition 6.2 | arxiv |
| Stacking number of paths, {*{Theorem 7.4 | statement | theorem 4.4 | arxiv |
| Complete graphs, {*{Theorem 8.1 | statement | theorem 4.1 | arxiv |
| ASH for odd cycles | statement | theorem 4.13 | arxiv |
| BXDFT4QJ50 | conjecture | conjecture 5.6 | arxiv |
| Path-clearing lemma | statement | lemma 6.8 | arxiv |
| Almost stacked configurations | definition | definition 3.1 | arxiv |
| Pushforward Lemma | statement | lemma 4.9 | arxiv |
| E9F1XTXT66 | definition | definition 6.1 | arxiv |
| EPFSJVGH5V | statement | theorem 6.9 | arxiv |
| GXNFA9H6QK | statement | theorem 6.13 | arxiv |
| ASH for even cycles | statement | theorem 4.12 | arxiv |
| The tree estimate | definition | definition 5.1 | arxiv |
| Path lower-bound configuration, {*{Theorem 7.3 | statement | theorem 4.3 | arxiv |
| P1VXH1EQZ8 | definition | definition 6.12 | arxiv |
| Almost stacked configurations on trees | statement | theorem 5.3 | arxiv |
| QYXQEAVKDQ | statement | corollary 6.6 | arxiv |
| Tree formula under ASH | statement | corollary 5.5 | arxiv |
| Almost stacked configurations on even cycles | statement | theorem 4.10 | arxiv |
| Extremal path configurations, {*{Definition 7.2 | definition | definition 4.2 | arxiv |
| Stacking and clearing | definition | definition 2.1 | arxiv |
| VJN7HRKPDK | definition | definition 6.10 | arxiv |
| XGFRG8AYBE | statement | theorem 6.11 | arxiv |
| Even-cycle lower bound, {*{Corollary 7.5 | statement | corollary 4.5 | arxiv |
Catalogue records
- arxiv: 2610.09650 (work)
- arxiv_text: 2610.09650 (work)
- zbmath_search: 903202196 (work)