Invisible runners in finite fields

DOI10.1016/J.IPL.2008.03.019zbMATH Open1191.68448OpenAlexW2013992130MaRDI QIDQ975401FDOQ975401

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

Recommendations

• On the Lonely Runner Conjecture.
• A note on the lonely runner conjecture
• The lonely runner with seven runners
• Random runners are very lonely
• Some remarks on the lonely runner conjecture

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)

Cites Work

• Research Problems in Discrete Geometry
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• View-obstruction problems. III
• The view-obstruction problem for \(n\)-dimensional cubes
• Non-averaging subsets and non-vanishing transversals
• Flows, view obstructions, and the lonely runner
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Colouring the real line
• Title not available (Why is that?)
• Colouring prime distance graphs
• View-obstruction problems
• View-obstruction: a shorter proof for 6 lonely runners
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday
• Pattern periodic coloring of distance graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform dilations
• Regular chromatic number and the lonely runner problem
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• 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
• LONELY RUNNERS IN FUNCTION FIELDS
• Lonely Runner Polyhedra
• The lonely runner problem for lacunary sequences
• Computing the covering radius of a polytope with an application to lonely runners

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

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