Metraipolis › archive › dc_196d22fd2719

Distinguishing adjacent vertices by ordering edges — arXiv:2609.11832

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11832
License (as archived)
CC0-1.0
Archived
2026-10-16T06:14:03.144Z
SHA-256 of the archived text
e31d5d1ba2cc1e2a8cb2c86d8a89515d8fa8d04f5f83ef37ec6dc99f497fcd8b
Stable URL of this page
https://metraipolis.com/documento/dc_196d22fd2719

How to cite

Distinguishing adjacent vertices by ordering edges — arXiv:2609.11832 — arXiv (en), https://arxiv.org/abs/2609.11832 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_196d22fd2719 (Metraipolis archive dc_196d22fd2719, sha256 e31d5d1ba2cc1e2a8cb2c86d8a89515d8fa8d04f5f83ef37ec6dc99f497fcd8b)
BibTeX
@misc{dc196d22fd2719,
  title = {Distinguishing adjacent vertices by ordering edges — arXiv:2609.11832},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11832},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_196d22fd2719; sha256 e31d5d1ba2cc1e2a8cb2c86d8a89515d8fa8d04f5f83ef37ec6dc99f497fcd8b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11832. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The 1-2-3 Conjecture states that for every graph without isolated edges, there exists an edge-weighting from $\{1,2,3\}$ such that adjacent vertices receive distinct sums of weights on their incident edges. In the sequence variant, adjacent vertices are to be distinguished by the sequences of weights on their incident edges. In this paper, we investigate whether, for every graph without isolated edges and for a fixed proper edge colouring (where colours are interpreted as weights), there exists a global total order of the edges such that the resulting sequences of incident weights distinguish adjacent vertices. For connected graphs, we prove that such an order exists whenever there exist two adjacent vertices that have distinct sets of incident weights. This yields a positive answer for every proper edge colouring of a connected non-regular graph or a connected graph of class two. Moreover, a probabilistic argument gives the same conclusion for connected regular graphs of degree at least six.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11832 — 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-16T05:59:08.312Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).