Kwaśny–Stawiski list infinite edge-motion conjecture
For every countable connected graph such that every nonidentity automorphism moves infinitely many edges, and for every assignment of a two-element list of available colors to each edge , there exists an edge coloring satisfying for all such that the only automorphism with for every is the identity automorphism.
Equivalent formulations
For every countable connected graph with infinite edge motion, .
source: Colorings breaking prescribed families of graph automorphisms
References
- Colorings breaking prescribed families of graph automorphisms — arXiv — Hui Lei, Yu Wang, Yueyue Zhao
Source: arXiv
Progress summary
A November 2026 preprint claims to prove the conjecture in full, but the result is unrefereed and has not been independently verified.
The conjecture asks whether every countable connected graph whose nontrivial automorphisms move infinitely many edges admits an edge coloring from arbitrary two-element lists that breaks all automorphisms. The list version is attributed to Kwaśny and Stawiski.
Known results
- The bound was known for countable regular graphs and subcubic graphs.
- The ordinary, non-list edge result was proved by Lehner.
- Equality between ordinary and list distinguishing numbers was known for subcubic and certain regular graphs.
November 2, 2026 claimed proof
On November 2, 2026, Hui Lei, Yu Wang, and Yueyue Zhao's preprint Colorings breaking prescribed families of graph automorphisms claimed the two-color list bound and broader ordinary/list equality results. This would settle the conjecture, but the preprint is unrefereed and the claim remains unverified.
Current status (as of November 2026): The conjecture has a claimed full proof, but only the regular and subcubic cases are independently recorded as established; the general result remains unverified.
Solutions 0
No solutions have been posted yet.