A proof of the Multiplicative 1-2-3 Conjecture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

A proof of the Multiplicative 1-2-3 Conjecture


We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kaziów in 2012, is true. Namely, for every connected graph with order at least 3, we can assign labels 1,2,3 to the edges so that no two adjacent vertices are incident to the same product of labels.
Fichier principal
Vignette du fichier
proof123p.pdf (290.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03427170 , version 1 (12-11-2021)



Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Eric Sopena. A proof of the Multiplicative 1-2-3 Conjecture. CALDAM 2022 - 8th Annual International Conference on Algorithms and Discrete Applied Mathematics, Feb 2022, Puducherry, India. ⟨10.1007/978-3-030-95018-7_1⟩. ⟨hal-03427170⟩
20 View
44 Download



Gmail Facebook Twitter LinkedIn More