scientific article; zbMATH DE number 5555985

MaRDI QIDQ3625841zbMATH OpenFDO

Authors Oriol Serra, Javier Barajas

Publication date 22 May 2009

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

zbMATH Keywords

circular chromatic numberDiophantine approximationlonely runner conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial number theory (11B75) Diophantine approximation, transcendental number theory (11J99) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Recommendations

• The lonely runner with seven runners
• A note on the lonely runner conjecture
• Some remarks on the lonely runner conjecture
• On the Lonely Runner Conjecture.
• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• The lonely runner problem for lacunary sequences
• Regular chromatic number and the lonely runner problem
• The runaway problem with four pursuers
• scientific article; zbMATH DE number 5919365
• Bounds for the lonely runner problems via linear programming

Cited in

(10)

• The lonely runner with seven runners
• View-obstruction: a shorter proof for 6 lonely runners
• On the time for a runner to get lonely
• Problems on track runners
• scientific article; zbMATH DE number 5919365 (Why is no real title available?)
• On the Lonely Runner Conjecture.
• Some remarks on the lonely runner conjecture
• scientific article; zbMATH DE number 5115930 (Why is no real title available?)
• Regular chromatic number and the lonely runner problem
• Six lonely runners

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625841)