A proof of the Multiplicative 1-2-3 Conjecture
Résumé
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.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|