Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups

Electronic Journal Of Combinatorics

Simon M. Smith¹ 

关键词: Distinguishing number;    Distinguishing coloring;    Infinite graph;    Infinite permutation group;    Imprimitive permutation group;    Imprimitive graph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A group of permutations $G$ of a set $V$ is $k$-distinguishable if there exists a partition of $V$ into $k$ cells such that only the identity permutation in $G$ fixes setwise all of the cells of the partition. The least cardinal number $k$ such that $(G,V

【 授权许可】

Others