# On the Chromatic Number of the Euclidean Plane

@inproceedings{Moorhousey1999OnTC, title={On the Chromatic Number of the Euclidean Plane}, author={G. Eric Moorhousey}, year={1999} }

- Published 1999

Deene two points of the Euclidean plane R 2 to be adjacent if they are at distance 1 from each other. It is known that the chromatic number of the resulting graph satisses 4 (R 2) 7. We obtain some partial results concerning (K 2) for subbelds K R. We believe that these results may help to focus the problem of determining (R 2)| either by providing a new upper bound, or by showing where to look for a new subgraph which increases the lower bound. 1. A Field-Theoretic Approach to the Problem Let… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

## Eigenvalues , Expanders and Gaps between Primes

View 5 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references

## Sphere Packings, Lattices and Groups, Second Edi- tion

## Algebraic theory of numbers

View 1 Excerpt