The lonely runner problem for lacunary sequences
DOI10.1016/J.DISC.2018.02.002zbMATH Open1406.11064OpenAlexW2790125290MaRDI QIDQ1709528FDOQ1709528
Authors: Sebastian Czerwiński 
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.002
Recommendations
Simultaneous homogeneous approximation, linear forms (11J13) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Distribution modulo one (11J71)
Cites Work
- The lonely runner with seven runners
- View-obstruction problems. III
- The view-obstruction problem for \(n\)-dimensional cubes
- Flows, view obstructions, and the lonely runner
- The chromatic number of random Cayley graphs
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Correlation among runners and some results on the lonely runner conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- Random runners are very lonely
- Title not available (Why is that?)
- Invisible runners in finite fields
- Title not available (Why is that?)
- The local cut lemma
- On the chromatic number of circulant graphs
- Distance graphs with finite chromatic number
- View-obstruction problems
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- View-obstruction: a shorter proof for 6 lonely runners
- Some remarks on the lonely runner conjecture
- A note on the lonely runner conjecture
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)
