Random runners are very lonely

DOI10.1016/j.jcta.2012.02.002zbMath1242.05090arXiv1102.4464OpenAlexW1993207395MaRDI QIDQ423640

Sebastian Czerwiński

Publication date: 4 June 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.4464

zbMATH Keywords

Diophantine approximationinteger distance graphslonely runner problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Diophantine inequalities (11J25)

Related Items (7)

Correlation among runners and some results on the lonely runner conjecture ⋮ Cosine sign correlation ⋮ The lonely runner problem for lacunary sequences ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Some remarks on the lonely runner conjecture ⋮ On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture ⋮ The chromatic number of random Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invisible runners in finite fields
• The lonely runner with seven runners
• View-obstruction problems. III
• The view-obstruction problem for \(n\)-dimensional cubes
• Flows, view obstructions, and the lonely runner
• Distance graphs with finite chromatic number
• View-obstruction: a shorter proof for 6 lonely runners
• The chromatic number of random Cayley graphs
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• View-obstruction problems
• Research Problems in Discrete Geometry
• Arithmetic progressions in sumsets
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday

This page was built for publication: Random runners are very lonely