The 1-2-3 conjecture for locally finite polygonal tilings
The 1-2-3 conjecture for locally finite polygonal tilings
Let be a locally finite tiling with a finite number of polygonal prototiles. Suppose
is a partition into translations of finitely many, not necessarily distinct, finite subgraphs, and let
be edge-weightings. The 1-2-3 conjecture for locally finite polygonal tilings. There exist such a partition and weightings that produce a global solution to the 1-2-3 problem, meaning that the resulting weighted degrees of adjacent vertices are different. This conjecture gives a more nuanced patch-based formulation after purely locally derivable solutions are shown not to exist for some tilings; the source does not state whether it has been resolved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Alison Charlesworth, Christopher Ramsey and Nicolae Strungaru, “The 1-2-3 conjecture for polygonal tilings”, arXiv:2604.15138 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.