Liu–Wang–Zhang's conjecture on the neighbourhood distinguishing index
Let be a connected graph, let be its maximum degree, and let be the smallest number of colours in a proper edge colouring for which adjacent vertices receive distinct sets of colours on their incident edges.
Liu–Wang–Zhang's conjecture. If , then
The lower bound is immediate, while the upper bound is known for bipartite graphs and graphs with maximum degree at most three, but remains open in general.
References
- Ben Seamone, “The 1-2-3 Conjecture and related problems: a survey”, arXiv:1211.5122 (2012).
Progress summary
Never refreshed
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.