Invisible runners in finite fields

DOI10.1016/j.ipl.2008.03.019zbMath1191.68448OpenAlexW2013992130MaRDI QIDQ975401

Sebastian Czerwiński, Jarosław Grytczuk

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.019

zbMATH Keywords

combinatorial problemsinteger distance graphsthe lonely runner problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Sequences (mod (m)) (11B50)

Related Items (7)

Correlation among runners and some results on the lonely runner conjecture ⋮ Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Random runners are very lonely ⋮ The lonely runner problem for lacunary sequences ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Lonely Runner Polyhedra ⋮ Computing the covering radius of a polytope with an application to lonely runners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• View-obstruction problems. III
• Pattern periodic coloring of distance graphs
• Uniform dilations
• The view-obstruction problem for \(n\)-dimensional cubes
• Non-averaging subsets and non-vanishing transversals
• Flows, view obstructions, and the lonely runner
• View-obstruction: a shorter proof for 6 lonely runners
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• View-obstruction problems
• Research Problems in Discrete Geometry
• Regular chromatic number and the lonely runner problem
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday

This page was built for publication: Invisible runners in finite fields