Distinguishing graphs with intermediate growth

DOI10.1007/s00493-015-3071-5zbMath1389.05070arXiv1301.0393OpenAlexW849813526MaRDI QIDQ2400107

Florian Lehner

Publication date: 25 August 2017

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0393

zbMATH Keywords

distinguishing number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Group actions on combinatorial structures (05E18)

Related Items (13)

THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Distinguishing infinite graphs with bounded degrees ⋮ List-distinguishing Cartesian products of cliques ⋮ Asymmetric colouring of locally compact permutation groups ⋮ Distinguishing density and the distinct spheres condition ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing graphs of maximum valence 3 ⋮ Coarse distinguishability of graphs with symmetric growth

Cites Work

• Distinguishability of infinite groups and graphs
• Distinguishing maps
• Cartesian powers of graphs can be distinguished by two labels
• Distinguishability of locally finite trees
• Symmetry breaking in graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing number of countable homogeneous relational structures
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing numbers of Cartesian products of multiple complete graphs
• Motion and distinguishing number two
• Distinguishing graphs with infinite motion and nonlinear growth
• Random Colourings and Automorphism Breaking in Locally Finite Graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Distinguishing graphs with intermediate growth