Invisible runners in finite fields

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

Jarosław Grytczuk, Sebastian Czerwiński

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 problems; integer distance graphs; the lonely runner problem

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

11B50: Sequences (mod (m))

Related Items

Random runners are very lonely

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item