Road coloring problem
From Wikipedia, the free encyclopedia
In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from any other point within a network (which might be a representation of city streets or a maze).[1] In the real world, this phenomenon would be as if you called a friend to ask for directions to his house, and he gave you a set of directions that worked no matter where you started from. This theorem also has implications in symbolic dynamics.
The theorem was first conjectured in 1970 by Benjamin Weiss and Roy Adler.[2] It was proved by Avraham Trahtman in September 2007. [3]
Contents |
[edit] Example and intuition
The image to the right shows a directed graph on eight vertices in which each vertex has out-degree 2. (Each vertex in this case also has in-degree 2, but that is not necessary for a synchronizing coloring to exist.) The edges of this graph have been colored red and blue to create a synchronizing coloring.
For example, consider the vertex marked in yellow. No matter where in the graph you start, if you traverse all nine edges in the walk "blue-red-red—blue-red-red—blue-red-red", you will end up at the yellow vertex. Similarly, if you traverse all nine edges in the walk "blue-blue-red—blue-blue-red—blue-blue-red", you will always end up at the vertex marked in green, no matter where you started.
The road coloring theorem states that for a certain category of directed graphs, it is always possible to create such a coloring.
[edit] Mathematical description
Let G be a finite directed graph where all the vertices have the same out-degree k. Let A be the alphabet containing the letters 1, ..., k. A synchronizing coloring (also known as a collapsible coloring) in G is a labeling of the edges in G with letters from A such that (1) each vertex has exactly one outgoing edge with a given label and (2) for every vertex v in the graph, there exists a word w over A such that all paths in G corresponding to w terminate at v.
The terminology synchronizing coloring is due to the relation between this notion and that of a synchronizing word in finite automata theory.
For such a coloring to exist at all, it is necessary that G be both strongly connected and aperiodic.[4] The road coloring problem states that these two conditions are also sufficient for such a coloring to exist. Therefore, the road coloring problem can be stated briefly as:
- Every finite strongly-connected aperiodic directed graph of uniform out-degree has a synchronizing coloring.
[edit] Previous partial results
Previous partial or special-case results include the following:
- If G is a finite strongly-connected aperiodic directed graph with no multiple edges, and G contains a simple cycle of prime length which is a proper subset of G, then G has a synchronizing coloring. (O'Brien 1981)
- If G is a finite strongly-connected aperiodic directed graph (multiple edges allowed) and every vertex has the same in-degree and out-degree k, then G has a synchronizing coloring. (Kari 2003)
[edit] References
- Jarkko Kari, "Synchronizing finite automata on Eulerian digraphs", Theoretical Computer Science 295 (2003), 223–232.
- G. L. O'Brien, "The road-coloring problem", Israel Journal of Mathematics, Vol. 39, 1981.
[edit] See also
[edit] Footnotes
- ^ Seigel-Itzkovich, Judy. "Russian immigrant solves math puzzle", The Jerusalem Post, 2008-02-08. Retrieved on 2008-03-21.
- ^ Heller, Aron. "After 38 years, Israeli solves math code", Yahoo! News, 2008-03-20. Retrieved on 2008-03-21.
- ^ Trahtman, Avraham. The road coloring problem. Retrieved on 2008-03-21.
- ^ http://www.emis.de/journals/DMTCS/pdfpapers/dmAE0155.pdf
