The 1-2-3 Conjecture and related problems: a survey

Abstract

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any adjacent vertices u and v, the sum of weights of edges incident to u differs from the sum of weights of edges incident to v." This survey paper presents the current state of research on the 1-2-3 Conjecture and the many variants that have been proposed in its short but active history.

30 pages, 2 tables, submitted for publication

Cited by in corpus (9)

• Proof of a local antimagic conjecture
• Vertex-coloring graphs with 4-edge-weightings
• On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
• Sigma Partitioning: Complexity and Random Graphs
• On the Standard (2,2)-Conjecture
• Neighbour sum distinguishing edge-weightings with local constraints
• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
• Total weight choosability for Halin graphs
• On offset Hamilton cycles in random hypergraphs