Metraipolis › archive › dc_299ba40ebb45

Every 2-Subdivision of a Cubic Graph Is Antimagic — arXiv:2608.11723

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11723
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:42.611Z
SHA-256 of the archived text
da6c6b00203b2f7dbfce9cefbc52da45bfcd4aa6e54a3ab406ad51b5c786ddcb
Stable URL of this page
https://metraipolis.com/documento/dc_299ba40ebb45

How to cite

Every 2-Subdivision of a Cubic Graph Is Antimagic — arXiv:2608.11723 — arXiv (en), https://arxiv.org/abs/2608.11723 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_299ba40ebb45 (Metraipolis archive dc_299ba40ebb45, sha256 da6c6b00203b2f7dbfce9cefbc52da45bfcd4aa6e54a3ab406ad51b5c786ddcb)
BibTeX
@misc{dc299ba40ebb45,
  title = {Every 2-Subdivision of a Cubic Graph Is Antimagic — arXiv:2608.11723},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11723},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_299ba40ebb45; sha256 da6c6b00203b2f7dbfce9cefbc52da45bfcd4aa6e54a3ab406ad51b5c786ddcb},
  year = {2026}
}

Archived text

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

Let G be a finite simple cubic graph, not necessarily connected, and let S_2(G) be obtained by subdividing every edge of G twice. Li (2025) developed general constructions for antimagic labelings of repeated subdivisions, but the cubic case G(3) = S_2(G) is not covered by those methods. Our first proof constructs an edge labeling of G in which every vertex sum is sufficiently large and occurs at most twice, and then uses an orientation after subdivision to separate the remaining equal sums. A second, direct construction uses the same path decomposition to make the internal contribution at each original vertex constant, while a unique endpoint contribution distinguishes the resulting sums. The direct construction further shows that S_2(G) is strongly antimagic whenever every vertex of G has odd degree at least three.

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