View-obstruction: a shorter proof for 6 lonely runners

2004/09/14 by Jérôme Renault · 14 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorial proof #Combinatorics #Computer science #Congruence (geometry) #Conjecture #Discrete mathematics #Elementary proof #Geometry #Graph Labeling and Dimension Problems #Integer (computer science) #Limits and Structures in Graph Theory #Mathematical proof #Mathematics #Modulo #Number theory #Set (abstract data type) #Simple (philosophy)

paper · pdf · doi:10.1016/j.disc.2004.06.008

published in Discrete Mathematics 287(1-3), 93-101 (Elsevier BV)

openalex publication_date 2004/09/14 · crossref created 2004/09/14 · crossref issued 2004/10/01 · crossref published 2004/10/01 · crossref published-print 2004/10/01 · crossref deposited 2020/04/03 · openalex created_date 2025/10/10 · crossref indexed 2026/04/29 · openalex updated_date 2026/08/02

Citations

• Flows, View Obstructions, and the Lonely Runner
• View-obstruction problems, III
• View-obstruction problems
• Untere Schranken f�r zwei diophantische Approximations-Funktionen
• View-obstruction problems in n-dimensional geometry
• Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen

Cited by

• On the chromatic number of circulant graphs
• Random runners are very lonely
• Invisible runners in finite fields
• The lonely runner problem for lacunary sequences
• The Lonely Runner with Seven Runners
• The lonely runner problem for many runners
• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• Lonely runner conjecture [wikipedia]