Six lonely runners

zbMath1011.11048MaRDI QIDQ5942557

Tom Bohman, Daniel J. Kleitman, Ron Holzman

Publication date: 16 October 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122608

zbMATH Keywords

covering

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Other problems of combinatorial convexity (52A37) Diophantine inequalities (11J25)

Related Items (17)

Correlation among runners and some results on the lonely runner conjecture ⋮ View-obstruction: a shorter proof for 6 lonely runners ⋮ Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ On the time for a runner to get lonely ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Coprime mappings and lonely runners ⋮ Regular chromatic number and the lonely runner problem ⋮ Solving lonely runner conjecture through differential geometry ⋮ Cosine sign correlation ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture ⋮ Lonely Runner Polyhedra ⋮ Sequences of integers with three missing separations ⋮ Problems on track runners ⋮ On the chromatic number of circulant graphs ⋮ Computing the covering radius of a polytope with an application to lonely runners

This page was built for publication: Six lonely runners