Distinguishing infinite graphs
Summary: The distinguishing number \(D(G)\) of a graph \(G\) is the least cardinal number \(\aleph\) such that \(G\) has a labeling with \(\aleph\) 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 no more than continuum many vertices have distinguishing number two, and determine the distinguishing number of many classes of infinite Cartesian products. For instance, \(D(Q_{\mathfrak n}) = 2\), where \(Q_{\mathfrak n}\) is the infinite hypercube of dimension \({\mathfrak n}\).
- Distinguishing infinite graphs with bounded degrees
- Distinguishing homomorphisms of infinite graphs
- The distinguishing index of infinite graphs
- Bounds for distinguishing invariants of infinite graphs
- scientific article; zbMATH DE number 15866
- Decomposing infinite graphs
- scientific article; zbMATH DE number 599133
- Distinguishability of infinite groups and graphs
- scientific article; zbMATH DE number 3943869
- Publication:3204497
- Extending precolorings to distinguish group actions
- On a theorem of Halin
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- A note on computable distinguishing colorings
- The cost of 2-distinguishing hypercubes
- On asymmetric colourings of claw-free graphs
- Symmetry parameters for Mycielskian graphs
- Distinguishing number of universal homogeneous Urysohn metric spaces
- Equitable distinguishing chromatic number
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Infinite motion and 2-distinguishability of graphs and groups
- Distinguishing graphs of maximum valence 3
- The distinguishing index of infinite graphs
- Bounds for distinguishing invariants of infinite graphs
- Distinguishing number of countable homogeneous relational structures
- Breaking graph symmetries by edge colourings
- Distinguishing number of hierarchical products of graphs
- Distinguishing graphs with infinite motion and nonlinear growth
- On distinquishing numbers
- Endomorphism breaking in graphs
- Distinguishability of infinite groups and graphs
- Infinite graphs with finite 2-distinguishing cost
- Graphoidally independent infinite graphs
- Distinguishing Cartesian products of countable graphs
- The list distinguishing number equals the distinguishing number for interval graphs
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- Paint cost and the frugal distinguishing number
- Distinguishing generalized Mycielskian graphs
- A rigid Urysohn-like metric space
- Distinguishing number and adjacency properties
- Distinguishing homomorphisms of infinite graphs
- scientific article; zbMATH DE number 7678748 (Why is no real title available?)
- Distinguishing orthogonality graphs
- Distinguishing threshold of graphs
- Distinguishing infinite graphs with bounded degrees
- Asymmetric colouring of locally compact permutation groups
- Strongly \(n\)-e.c. graphs and independent distinguishing labellings
- On asymmetric colourings of graphs with bounded degrees and infinite motion
- Brooks' type theorems for coloring parameters of locally finite graphs and Kőnig's Lemma
- Determining number and cost of generalized Mycielskian graphs
- Distinguishing chromatic number of the hierarchical product of graphs
- Bounding the distinguishing number of infinite graphs and permutation groups
- Number of distinguishing colorings and partitions
- Distinguishability of locally finite trees
- Local finiteness, distinguishing numbers, and Tucker's conjecture
- The distinguishing chromatic number of Cartesian products of two complete graphs
This page was built for publication: Distinguishing infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372880)
