Advertisement

aequationes mathematicae

, Volume 51, Issue 1–2, pp 48–67 | Cite as

Unit-distance graphs, graphs on the integer lattice and a Ramsey type result

  • Kiran B. Chilakamarri
  • Carolyn R. Mahoney
Research Papers
  • 30 Downloads

Summary

Let (R2, 1) denote the graph withR2 as the vertex set and two vertices adjacent if and only if their Euclidean distance is 1. The problem of determining the chromatic numberχ(R2, 1) is still open; however,χ(R2, 1) is known to be between 4 and 7. By a theorem of de Bruijn and Erdös, it is enough to consider only finite subgraphs of (R2, 1). By a recent theorem of Chilakamarri, it is enough to consider certain graphs on the integer lattice. More precisely, forr > 0, let (Z2,r,\(\sqrt 2 \)) denote a graph with vertex setZ2 and two vertices adjacent if and only if their Euclidean distance is in the closed interval [r\(\sqrt 2 \),r +\(\sqrt 2 \)]. A simple graph is faithfully\(\sqrt 2 \)-recurring inZ2 if there exists a real numberd > 0 such that, for arbitrarily larger, G is isomorphic to a subgraph of (Z2,r,\(\sqrt 2 \)) in which every pair of vertices are at least distancedr apart. Chilakamarri has shown that, ifG is a finite simple graph, thenG is isomorphic to a subgraph of (R2, 1) if and only ifG is faithfully\(\sqrt 2 \)-recurring inZ2. In this paper we prove thatχ(Z2,r,\(\sqrt 2 \)) ≥ 5 for integersr ≥ 1. We also prove a Ramsey type result which states that for any integerr > 1, and any coloring ofZ2 either there exists a monochromatic pair of vertices with their distance in the closed interval [r\(\sqrt 2 \),r +\(\sqrt 2 \)] or there exists a set of three vertices closest to each other with three distinct colors.

AMS (1991) subject classification

05C15 05C55 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Chilakamarri, K. B.,A characterization in Z n of finite unit-distance graphs in R n. J. Combin. Theory Ser. B59 (1993), 156–160.CrossRefGoogle Scholar
  2. [2]
    de Bruijn, N. G. andErdös, P.,A colour problem for infinite graphs and a problem in the theory of relations. Indag. Math. (N.S.)13 (1951), 371–373.Google Scholar
  3. [3]
    Hadwiger, H., Debrunner, H. andKlee, V.,Combinatorial geometry in the plane. Holt, Rinehart and Winston, New York, 1964.Google Scholar
  4. [4]
    Klee, V. andWagon, S.,Old and new unsolved problems in plane geometry and number theory. Mathematical Association of America, Washington, D.C., 1991.Google Scholar
  5. [5]
    Moser, L. andMoser, W., “Solution to problem 10”. Canad. Math. Bull.4 (1961), 187–189.Google Scholar

Copyright information

© Birkhäuser Verlag 1996

Authors and Affiliations

  • Kiran B. Chilakamarri
    • 1
    • 2
  • Carolyn R. Mahoney
    • 1
    • 2
  1. 1.Department of MathematicsCalifornia State University San MarcosSan MarcosUSA
  2. 2.Department of Mathematics and Computer ScienceCentral State UniversityWilberforceUSA

Personalised recommendations