On chromatic number of unit-quadrance graphs (finite Euclidean graphs)

Details On chromatic number of unit-quadrance graphs (finite Euclidean graphs) On chromatic number of unit-quadrance graphs (finite Euclidean graphs)

2005-10-05

arxiv.org/abs/math/0510092v1

Mathematics

Combinatorics

5 pages

Scientific paper

The quadrance between two points A_1=(x_1, y_1) and A_2=(x_2, y_2) is the number Q (A_1, A_2) = (x_1 - x_2)^2 + (y_1 - y_2)^2. Let q be an odd prime power and F_q be the finite field with $q$ elements. The unit-quadrance graph D_q has the vertex set F_q^2, and X, Y in F_q^2 are adjacent if and only if Q(A_1, A_2) = 1. Let \chi(F_q^2) be the chromatic number of graph D_q. In this note, we will show that q^{1/2}(1/2+o(1)) <= \chi(F_q^2) <= q(1/2 + o(1)). As a corollary, we have a construction of triangle-free graphs D_q of order q^2 with \chi(D_q) >= q/2 for infinitely many values of q.

Affiliated with

Also associated with

No associations

Rating

On chromatic number of unit-quadrance graphs (finite Euclidean graphs) 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 On chromatic number of unit-quadrance graphs (finite Euclidean graphs), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On chromatic number of unit-quadrance graphs (finite Euclidean graphs) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250312