The lonely runner with seven runners

Details The lonely runner with seven runners The lonely runner with seven runners

2007-10-24

arxiv.org/abs/0710.4495v1

Mathematics

Combinatorics

Scientific paper

Suppose $k+1$ runners having nonzero constant 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.

Affiliated with

Also associated with

No associations

Rating

The lonely runner with seven runners does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The lonely runner with seven runners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The lonely runner with seven runners will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655384