Diophantine approximation and coloring
classification
🧮 math.NT
math.CO
keywords
approximationdiophantineaccessiblecoloringconjunctionconnectionsdemonstratedifficult
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.