A proof of the lonely runner conjecture
From MaRDI portal
Publication:6235752
arXiv1209.3920MaRDI QIDQ6235752FDOQ6235752
Authors: O. Kurganskyy 
Publication date: 18 September 2012
Abstract: In this work we tried to prove the lonely runner conjecture also known as the view obstruction problem.
Coloring of graphs and hypergraphs (05C15) Diophantine approximation, transcendental number theory (11J99)
This page was built for publication: A proof of the lonely runner conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235752)
