Distinguishing Infinite Graphs


The distinguishing number D(G) of a graph G is the least cardinal number א such that G has a labeling with א labels that is only preserved by the trivial automorphism. We show that the distinguishing number of the countable random graph is two, that tree-like graphs with not more than continuum many vertices have distinguishing number two, and determine the… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics