Metraipolis › archive › dc_ac04c6ed8dfe
List-distance consistent vertices in trees are confined to a path — arXiv:2609.03803
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03803
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:33:25.838Z
- SHA-256 of the archived text
94acd4719a66ff7d6f3d8dcdee85882bd83bcef901295b33b5f9c76dd9ce2d0a- Stable URL of this page
https://metraipolis.com/documento/dc_ac04c6ed8dfe
How to cite
List-distance consistent vertices in trees are confined to a path — arXiv:2609.03803 — arXiv (en), https://arxiv.org/abs/2609.03803 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ac04c6ed8dfe (Metraipolis archive dc_ac04c6ed8dfe, sha256 94acd4719a66ff7d6f3d8dcdee85882bd83bcef901295b33b5f9c76dd9ce2d0a)
BibTeX
@misc{dcac04c6ed8dfe,
title = {List-distance consistent vertices in trees are confined to a path — arXiv:2609.03803},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03803},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ac04c6ed8dfe; sha256 94acd4719a66ff7d6f3d8dcdee85882bd83bcef901295b33b5f9c76dd9ce2d0a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03803. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A labeling of a connected graph $G$ on $n$ vertices is a bijection $c:V(G)\to\{1,\dots,n\}$; writing $c(u,v)=|c(u)-c(v)|$, a vertex $u$ is list-distance consistent if $d(u,v)<d(u,w)$ implies $c(u,v)\le c(u,w)$ for all $v,w$. The maximum number of such vertices over all labelings is the list-distance consistency ldc$(G)$, introduced by Casselgren and Henricsson. We prove that in a tree, the consistent vertices of any labeling lie on a single path, along which the labels form a block of consecutive integers in increasing order (with respect to a suitable orientation of the path), no vertex off the path receiving a label from that block. We deduce that ldc equals $3$ for every complete $k$-ary tree except the binary tree of height two, and we determine ldc for all spiders.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.03803 — 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-17T02:09:21.186Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).