The multigraph formulation of the 1-2-3 Conjecture
The multigraph formulation of the 1-2-3 Conjecture
Let be a graph, and let be the family of multigraphs obtained from by edge multiplication with edge multiplicities at most . A multigraph is locally irregular when adjacent vertices have distinct multigraph degrees. 1-2-3 Conjecture. For every graph containing no isolated edges, there exists a locally irregular multigraph . This is the multigraph formulation of the neighbor-sum-distinguishing 1-2-3 Conjecture, which the source describes as open and equivalent to the preceding formulation.
Sources & referencesView supporting material
Primary source
Igor Grzelec and Mariusz Woźniak, “On decomposing multigraphs into locally irregular submultigraphs”, arXiv:2208.08809 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.