The lonely runner problem for lacunary sequences
From MaRDI portal
Publication:1709528
Recommendations
Cites work
- scientific article; zbMATH DE number 5919365 (Why is no real title available?)
- scientific article; zbMATH DE number 5115930 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 713428 (Why is no real title available?)
- A note on the lonely runner conjecture
- Correlation among runners and some results on the lonely runner conjecture
- Distance graphs with finite chromatic number
- Flows, view obstructions, and the lonely runner
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- Invisible runners in finite fields
- On the chromatic number of circulant graphs
- Random runners are very lonely
- Some remarks on the lonely runner conjecture
- The chromatic number of random Cayley graphs
- The local cut lemma
- The lonely runner with seven runners
- The view-obstruction problem for \(n\)-dimensional cubes
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- View-obstruction problems
- View-obstruction problems. III
- View-obstruction: a shorter proof for 6 lonely runners
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
Cited in
(3)
This page was built for publication: The lonely runner problem for lacunary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709528)