The total 1-2 Conjecture
Let be a graph. A total -weighting assigns weights from to every vertex and edge, and is the least for which some such weighting properly colours adjacent vertices by the sums of the weight at the vertex and the weights on its incident edges.
Total 1-2 Conjecture. For every graph ,
The conjecture is a total-weighting analogue of the 1-2-3 Conjecture. The source records the best general bound as , so the conjecture remains open.
Equivalent formulations
Let be a connected graph. Assign numbers to both vertices and edges, and define . A decoration is total cool if for every adjacent pair . The total 1-2 Conjecture. Every connected graph has a total cool decoration from the set . This is the natural total analogue of the 1-2-3 Conjecture; the corresponding list version is also open.
source: Jarosław Grytczuk, “From the 1-2-3 Conjecture to the Riemann Hypothesis”, arXiv:2003.02887 (2020).
References
- Ben Seamone, “The 1-2-3 Conjecture and related problems: a survey”, arXiv:1211.5122 (2012).
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
No solutions have been posted yet.