论文标题
区分常规图与列表
Distinguishing regular graphs from lists
论文作者
论文摘要
图的边缘着色称为区分是否没有保留它的非平凡的自动形态。我们证明，每一个最可计数，有限或无限，连接的常规订单图表至少$ 7 $都承认了与任何一套长度$ 2 $列表的区别边缘着色。此外，我们表明，对于连接的常规图$κ$，$κ$是Aleph层次结构的固定点，也是如此。
An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a distinguishing edge colouring from any set of lists of length $2$. Furthermore, we show that the same holds for connected regular graphs of order $κ$ where $κ$ is a fixed point of the aleph hierarchy.
