Coloring Distance Graphs on the Integers

Details Coloring Distance Graphs on the Integers Coloring Distance Graphs on the Integers

1998-05-19

arxiv.org/abs/math/9805084v1

Mathematics

Combinatorics

12 pages, no figures

Scientific paper

Given a set D of positive integers, the associated distance graph on the integers is the graph with the integers as vertices and an edge between distinct vertices if their difference lies in D. We investigate the chromatic numbers of distance graphs. We show that, if $D = {d_1,d_2,d_3,...}$, with $d_n | d_{n+1}$ for all n, then the distance graph has a proper 4-coloring. We further find the exact chromatic numbers of all such distance graphs. Next, we characterize those distance graphs that have periodic proper colorings and show a relationship between the chromatic number and the existence of periodic proper colorings.

Affiliated with

Also associated with

No associations

Rating

Coloring Distance Graphs on the Integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coloring Distance Graphs on the Integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coloring Distance Graphs on the Integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498570