Diophantine approximation and coloring
Preprint
Abstract
We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Probl mes diophantiens simultan sMonatshefte für Mathematik, 2004
- Distance Graphs with Finite Chromatic NumberJournal of Combinatorial Theory, Series B, 2002
- Chromatic Numbers of Cayley Graphs on Z and RecurrenceCombinatorica, 2001
- Numbers contravening a condition in density modulo 1Acta Mathematica Hungarica, 1980