Abstract
Let D be a set of positive integers. The distance graph generated by D has all integers ℤ as the vertex set; two vertices are adjacent whenever their absolute difference falls in D. We completely determine the chromatic number for the distance graphs generated by the sets D={2,3,x,y} for all values x and y. The methods we use include the density of sequences with missing differences and the parameter involved in the so called “lonely runner conjecture”. Previous results on this problem include: For x and y being prime numbers, this problem was completely solved by Voigt and Walther (Discrete Appl. Math. 51:197–209, 1994); and other results for special integers of x and y were obtained by Kemnitz and Kolberg (Discrete Math. 191:113–123, 1998) and by Voigt and Walther (Discrete Math. 97:395–397, 1991).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barajas J, Serra O (2008a) Distance graphs with maximum chromatic number. Discrete Math 308:1355–1365
Barajas J, Serra O (2008b) The lonely runner with seven runners. Electron J Comb 15:#R48
Betke U, Wills JM (1972) Untere Schranken für zwei diophantische approximations-Funktionen. Monatsch Math 76:214–217
Bienia W, Goddyn L, Gvozdjak P, Sebő A, Tarsi M (1998) Flows, view obstructions, and the lonely runner. J Comb Theory, Ser B 72:1–9
Bohman T, Holzman R, Kleitman D (2001) Six lonely runners. Electron J Comb 8 (Research Paper 3, 49 pp)
Cantor DG, Gordon B (1973) Sequences of integers with missing differences. J Comb Theory, Ser A 14:281–287
Chang GJ, Huang L, Zhu X (1998) The circular chromatic numbers and the fractional chromatic numbers of distance graphs. Eur J Comb 19:423–431
Chang G, Liu D, Zhu X (1999) Distance graphs and T-coloring. J Comb Theory, Ser B 75:159–169
Chen J, Chang GJ, Huang K (1997) Integral distance graphs. J Graph Theory 25:287–294
Cusick TW (1974) View-obstruction problems in n-dimensional geometry. J Comb Theory, Ser A 16:1–11
Cusick TW, Pomerance C (1984) View-obstruction problems, III. J Number Theory 19:131–139
Eggleton RB, Erdős P, Skilton DK (1985) Colouring the real line. J Comb Theory, Ser B 39:86–100
Eggleton RB, Erdős P, Skilton DK (1986) Research problem 77. Discrete Math 58:323
Eggleton RB, Erdős P, Skilton DK (1988) Update information on research problem 77. Discrete Math 69:105
Eggleton RB, Erdős P, Skilton DK (1990) Colouring prime distance graphs. Graphs Comb 6:17–32
Hadwiger H, Debrunner H, Klee V (1964) Combinatorial geometry in the plane. Holt Rinehart and Winston, New York
Haralambis NM (1977) Sets of integers with missing differences. J Comb Theory, Ser A 23:22–33
Kemnitz A, Kolberg H (1998) Coloring of integer distance graphs. Discrete Math 191:113–123
Kemnitz A, Marangio M (2001a) Colorings and list colorings of integer distance graphs. Congr Numer 151:75–84
Kemnitz A, Marangio M (2001b) Chromatic numbers of integer distance graphs. Discrete Math 233:239–246
Lam P, Lin W (2005) Coloring distance graphs with intervals as distance sets. Eur J Comb 26:1216–1229
Liu D (2000) T-coloring and chromatic number of distance graphs. Ars Comb 56:65–80
Liu D (2008) From rainbow to the lonely runner: A survey on coloring parameters of distance graphs. Taiwan J Math 12:851–871
Liu D, Zhu X (1999) Distance graphs with missing multiples in the distance sets. J Graph Theory 30:245–259
Liu D, Zhu X (2004) Fractional chromatic number and circular chromatic number for distance graphs with large clique size. J Graph Theory 47:129–146
Liu D, Zhu X (2008) Distance graphs generated by two-interval sets. Eur J Comb 29:1733–1743
Moser L, Moser W (1961) Solution to problem 10. Can Math Bull 4:187–189
Scheinerman ER, Ullman DH (1997) Fractional graph theory. Wiley-Interscience series in discrete mathematics and optimization
Voigt M (1999) Colouring of distance graphs. Ars Comb 52:3–12
Voigt M, Walther H (1991) On the chromatic number of special distance graphs. Discrete Math 97:395–397
Voigt M, Walther H (1994) Chromatic number of prime distance graphs. Discrete Appl Math 51:197–209
Wills JM (1967) Zwei Sätze über inhomogene diophantische approximation von irrationlzahlen. Monatsch Math 71:263–269
Zhu X (1997) Pattern periodic coloring of distance graphs. J Comb Theory, Ser B 73:195–206
Zhu X (2001) Circular chromatic number: A survey. Discrete Math 229:371–410
Zhu X (2002) The circular chromatic number of distance graphs with distance sets of cardinality 3. J Graph Theory 41:195–207
Zhu X (2003) The circular chromatic number of a class of distance graphs. Discrete Math 265(1–3):337–350
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, D.DF., Sutedja, A. Chromatic number of distance graphs generated by the sets {2,3,x,y}. J Comb Optim 25, 680–693 (2013). https://doi.org/10.1007/s10878-012-9509-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9509-4