Distance graph on ℤn with ℓ1 norm

Theoretical Computer Science

Volumn 319, Issue 1-3, 2004, Pages 357-366

  Füredi, Zoltán ^a,b   Kang, Jeong Hyun ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Coloring metric spaces; Integer grid; Unit distance graph

Indexed keywords

COMBINATORIAL MATHEMATICS; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

CHROMATIC NUMBERS; COLORING METRIC SPACES; COMBINATORIAL GEOMETRY;

COMPUTER SCIENCE;

EID: 2442589431     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.010     Document Type: Conference Paper

References (9)

1. M. Benda, M.A. Perles, Coloring of metric spaces 9 (2000) 113-126.
2. Chilakamarri K. A unit-distance graph problem. a brief survey and some new results Bull. Inst. Combin. Appl. 8:1993;39-60.
3. Frankl P., Wilson R.M. Intersection theorems with geometric consequences. Combinatorica. 1:1981;357-368.
4. Z. Füredi, J.-H. Kang, Covering n -space by convex bodies and its chromatic number, Preprint, Department of Mathematics, UIUC, submitted for publication.
5. Larman D.G., Rogers C.A. The realization of distances within sets in Euclidean space. Mathematika. 19:1972;1-24.
6. M. Morayne, The chromatic number of the plane, Presentation at MIGHTY Conf. 2002.
7. Woodall D.R. Distances realized by sets covering the plane. J. Combin. Theory Ser. A. 14:1973;187-200.
8. A.M. Raigorodskii, Borsuk's problem and the chromatic number of some metric spaces, Uspekhi Mat. Nauk 56 (2001) 107-146; translation in Russian Math. Surveys 56 (2001) 103-139.
9. A.M. Raigorodskii, Borsuk's problem and the chromatic number of some metric spaces, Uspekhi Mat. Nauk 56 (2001) 107-146; translation in Russian Math. Surveys 56 (2001) 103-139.