Metraipolis › archive › dc_2e8bb42aa9c4
$e$-Positive caterpillars have maximum degree at most three — arXiv:2610.39481
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39481
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:37:55.513Z
- SHA-256 of the archived text
aa3c5c7c607a0217ca8ef2bceeed09110e690f499770349d65a072ef292b7a77- Stable URL of this page
https://metraipolis.com/documento/dc_2e8bb42aa9c4
How to cite
$e$-Positive caterpillars have maximum degree at most three — arXiv:2610.39481 — arXiv (en), https://arxiv.org/abs/2610.39481 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e8bb42aa9c4 (Metraipolis archive dc_2e8bb42aa9c4, sha256 aa3c5c7c607a0217ca8ef2bceeed09110e690f499770349d65a072ef292b7a77)
BibTeX
@misc{dc2e8bb42aa9c4,
title = {$e$-Positive caterpillars have maximum degree at most three — arXiv:2610.39481},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39481},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e8bb42aa9c4; sha256 aa3c5c7c607a0217ca8ef2bceeed09110e690f499770349d65a072ef292b7a77},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39481. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Dahlberg, She, and van Willigenburg conjectured that every $e$-positive tree has maximum degree at most three. We prove this conjecture for caterpillars. Our proof introduces a specialization--cone method: we evaluate chromatic symmetric functions under finite-support specializations that are nonnegative on the elementary symmetric functions, express the evaluations through transfer matrices, and certify negativity using finitely generated cones. Two specializations and three cones handle all caterpillars remaining after a connected-partition reduction, with no bound on the number or spacing of their trivalent vertices. The required cone inclusions and strict sign inequalities are certified by exact rational arithmetic. We also exhibit two infinite families of non-spider caterpillars of maximum degree four that admit connected partitions of every type, showing that Wolfgang's criterion alone leaves cases requiring further obstructions. Our result also reduces Li's criterion on $e$-positivity for caterpillars of maximum degree three to an explicit condition on the positions of trivalent vertices. 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.39481 — 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-11-01T02:15:28.274Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).