Corpus ID: 237278300

A proof of the Multiplicative 1-2-3 Conjecture

@article{Bensmail2021APO,
  title={A proof of the Multiplicative 1-2-3 Conjecture},
  author={Julien Bensmail and Herv{\'e} Hocquard and Dimitri Lajou and {\'E}ric Sopena},
  journal={ArXiv},
  year={2021},
  volume={abs/2108.10554}
}
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 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. 

References

SHOWING 1-9 OF 9 REFERENCES
Further Evidence Towards the Multiplicative 1-2-3 Conjecture
TLDR
It is proved that 4-chromatic graphs verify the product version of the 1-2-3 Conjecture, which states that all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of labels. Expand
The 1-2-3 Conjecture almost holds for regular graphs
  • Jakub Przybylo
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 2021
TLDR
It is proved that for regular graphs it is sufficient to use weights $1, $2, $3, $4$ so that adjacent vertices receive distinct weighted degrees. Expand
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
TLDR
This paper shows that a weighting of the edges of a graph is possible from the weight set {1,2,3,4,5} for all graphs not containing components with exactly 2 vertices. Expand
Combinatorial Nullstellensatz
A recently formulated technique in algebraic combinatorics will be considered. After introducing the framework and proving the main theorem, some applications of Combinatorial Nullstellensatz toExpand
Multiplicative vertex-colouring weightings of graphs
TLDR
It is shown that the edges of every non-trivial graph can be weighted with integers 1, 2, 3, 4 in such a way that the adjacent vertices have different products of incident edge weights. Expand
Edge weights and vertex colours
Can the edges of any non-trivial graph be assigned weights from {1, 2, 3} so that adjacent vertices have different sums of incident edge weights?We give a positive answer when the graph isExpand
Multi-set neighbor distinguishing 3-edge coloring
TLDR
It is proved that three colors are sufficient to produce a multi-set neighbor distinguishing edge coloring for every graph without isolated edges. Expand
Vertex colouring edge partitions
TLDR
It is shown that the edges of every graph can be partitioned into 4 sets such that the resultant multisets give a vertex colouring of G. Expand
A Dynamic Survey of Graph Labeling
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening yearsExpand