A note on the 1-2-3 Theorem for infinite graphs

arXiv2304.10208MaRDI QIDQ6433731FDOQ6433731

Authors: Marcin Stawiski 

Publication date: 20 April 2023

Abstract: Karo'nski, {L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $1,2,3$ in such a way that the endvertices of each edge have different sums of incident edge weights. This is known as the 1-2-3 Conjecture, and it was only recently proved by Keusch. We extend this result to infinite graphs in the following way. If $G$ is a graph without isolated edge, then the edges can be assigned weights from $1,2,3$ is such a way that the endvertices of each edge have different sum of incident edge weights, or these endvertices have both the same infinite degree. We also investigate the extensions of theorems about total and list versions of 1-2-3 Conjecture to infinite graphs.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: A note on the 1-2-3 Theorem for infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433731)