2000 character limit reached
A proof of the Multiplicative 1-2-3 Conjecture
Published 24 Aug 2021 in cs.DM and math.CO | (2108.10554v2)
Abstract: We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kazi{\'o}w in 2012, is true. Namely, for every connected graph with order at least 3, we prove that we can assign labels 1,2,3 to the edges in such a way that no two adjacent vertices are incident to the same product of labels.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.