Metraipolis › archive › dc_86ab34c32e2e
On the Greedoid Tutte Polynomial for simple rooted graphs — arXiv:2608.20843
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.20843
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T10:46:55.895Z
- SHA-256 of the archived text
7c2c88c38a95efecb2384a7d17e2ccb4d7d5fafcb5e7cc632e17346899706719- Stable URL of this page
https://metraipolis.com/documento/dc_86ab34c32e2e
How to cite
On the Greedoid Tutte Polynomial for simple rooted graphs — arXiv:2608.20843 — arXiv (en), https://arxiv.org/abs/2608.20843 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_86ab34c32e2e (Metraipolis archive dc_86ab34c32e2e, sha256 7c2c88c38a95efecb2384a7d17e2ccb4d7d5fafcb5e7cc632e17346899706719)
BibTeX
@misc{dc86ab34c32e2e,
title = {On the Greedoid Tutte Polynomial for simple rooted graphs — arXiv:2608.20843},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.20843},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_86ab34c32e2e; sha256 7c2c88c38a95efecb2384a7d17e2ccb4d7d5fafcb5e7cc632e17346899706719},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.20843. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Tutte polynomial, through its rank-generating formula, provides a unified framework for describing various combinatorial structures of graphs and matroids, and serves as an important polynomial invariant connecting graph theory, matroid theory, and their related applications. Let $G=(V(G),E(G),r(G))$ be a simple rooted graph, where $V(G)$ is the vertex set, $E(G)$ is the edge set, and $r(G)$ is the root. Let $\Gamma(G)$ be the greedoid induced by the rooted graph $G$, and let its greedoid Tutte polynomial be denoted by $T(\Gamma(G);x,y)$. Let $r=r(G)$, $L_r(G)=\{v\in V(G)\setminus\{r\}: rv\in E(G),\ d_G(v)=1\}$, and $\ell_r(G)=|L_r(G)|$. Gordon and McMahon proposed the following conjecture: for rooted graphs, $\operatorname{ord}_{x}T(\Gamma(G);x,y)=\ell_r(G)$, where $\operatorname{ord}_{x}T(\Gamma(G);x,y)=\max\{a\in\mathbb Z_{\geq0}:x^a\mid T(\Gamma(G);x,y)\}$, that is, the highest power of $x$ dividing $T(\Gamma(G);x,y)$ is equal to the number of leaf vertices adjacent to the root. In this paper, we proved that this conjecture holds for all simple rooted graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.20843 — 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-18T10:39:26.741Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).