A proof of the lonely runner conjecture

MaRDI QIDQ6235752zbMATH OpenFDO

Authors O. Kurganskyy

Publication date 18 September 2012

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Diophantine approximation, transcendental number theory (11J99)

Abstract: In this work we tried to prove the lonely runner conjecture also known as the view obstruction problem.

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)