The distinguishing-index conjecture for connected finite regular graphs
Let be a connected, finite, regular graph, and let denote the least number of colours needed to colour the edges of so that the only colour-preserving automorphism is the identity. The regular-graph distinguishing-index conjecture. Then , unless is either for , for , or . This would improve the general bound for distinguishing indices in the regular case; the paper proves the weaker general estimate but presents this sharper assertion as conjectural.
References
- Florian Lehner, Monika Pilśniak and Marcin Stawiski, “A bound for the distinguishing index of regular graphs”, arXiv:1911.11105 (2020).
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.