The Lonely Runner Conjecture turns 60

The Lonely Runner Conjecture originated in Diophantine approximation is turning 60. Even if the conjecture is still widely open, the flow of partial results, innovative tools and connections to different problems and applications has been steady on its long life. This survey attempts to give a panoramic view of the status of the problem, trying to highlight the contributions of the many papers that it has originated.

Authors

Institutions

Publication Details

Journal
Computer Science Review
Published
2025-08-09
DOI
https://doi.org/10.1016/j.cosrev.2025.100798
Citations
1
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
5.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Lonely Runner Conjecture turns 60

Oriol Serra, Guillem Perarnau
1 citations
Computer Science Review
Limits and Structures in Graph Theory
5.33
article

The Lonely Runner Conjecture turns 60

Oriol Serra, Guillem Perarnau
article en
1 citations

Abstract

The Lonely Runner Conjecture originated in Diophantine approximation is turning 60. Even if the conjecture is still widely open, the flow of partial results, innovative tools and connections to different problems and applications has been steady on its long life. This survey attempts to give a panoramic view of the status of the problem, trying to highlight the contributions of the many papers that it has originated.

Computer Science ReviewVol. 58
Centre de Recerca Matemàtica (ES), Universitat Politècnica de Catalunya (ES)
Openalex Percentile: Top 6%
Limits and Structures in Graph Theory
5.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.