Geodesic
The lonely runner with seven runners
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
Suppose $k+1$ runners having nonzero constant pairwise distinct speeds run laps on a unit-length circular track starting at the same time and place. A runner is said to be lonely if she is at distance at least $1/(k+1)$ along the track to every other runner. The lonely runner conjecture states that every runner gets lonely. The conjecture has been proved up to six runners ($k\le 5$). A formulation of the problem is related to the regular chromatic number of distance graphs. We use a new tool developed in this context to solve the first open case of the conjecture with seven runners.
DOI : 10.37236/772
Classification : 11B75, 11J71, 05C15
Mots-clés : view obstruction problems 
J. Barajas; O. Serra. The lonely runner with seven runners. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/772
@article{10_37236_772,
     author = {J. Barajas and O. Serra},
     title = {The lonely runner with seven runners},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/772},
     zbl = {1206.11030},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/772/}
}
TY  - JOUR
AU  - J. Barajas
AU  - O. Serra
TI  - The lonely runner with seven runners
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/772/
DO  - 10.37236/772
ID  - 10_37236_772
ER  - 
%0 Journal Article
%A J. Barajas
%A O. Serra
%T The lonely runner with seven runners
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/772/
%R 10.37236/772
%F 10_37236_772

Cité par Sources :