Summer Conference on Topology and Its Applications

Document Type

Topology + Dynamics and Continuum Theory

Publication Date


Publication Source

32nd Summer Conference on Topology and Its Applications


A graph coloring is strongly aperiodic if every colored graph in its hull has no automorphisms. The talk will describe a method to define strongly aperiodic colorings on graphs with bounded degree. This also provides an optimal bound for the strongly distinguishing number of a graph. Then some applications to the theory of foliated spaces and to tilings will be discussed.


This document is available for download with the permission of the presenting author and the organizers of the conference. Permission documentation is on file.

Technological limitations may prevent some mathematical symbols and functions from displaying correctly in this record’s metadata fields. Please refer to the attached PDF for the correct display.