View-obstruction: a shorter proof for 6 lonely runners
From MaRDI portal
Publication:1886345
DOI10.1016/j.disc.2004.06.008zbMath1061.11036DBLPjournals/dm/Renault04OpenAlexW2125641832WikidataQ56766746 ScholiaQ56766746MaRDI QIDQ1886345
Publication date: 18 November 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/6201
Related Items (11)
Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ On the time for a runner to get lonely ⋮ Regular chromatic number and the lonely runner problem ⋮ Solving lonely runner conjecture through differential geometry ⋮ Random runners are very lonely ⋮ Cosine sign correlation ⋮ The lonely runner problem for lacunary sequences ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Invisible runners in finite fields ⋮ Lonely Runner Polyhedra ⋮ On the chromatic number of circulant graphs
Cites Work
- View-obstruction problems. III
- Flows, view obstructions, and the lonely runner
- View-obstruction problems in \(n\)-dimensional geometry
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Untere Schranken für zwei diophantische Approximations-Funktionen
- View-obstruction problems
- View-Obstruction Problems. II
- Six lonely runners
This page was built for publication: View-obstruction: a shorter proof for 6 lonely runners