Untere Schranken für zwei diophantische Approximations-Funktionen
From MaRDI portal
Publication:2553463
Cites work
Cited in
(16)- 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
- LONELY RUNNERS IN FUNCTION FIELDS
- View-obstruction problems. III
- The view-obstruction problem for \(n\)-dimensional cubes
- Flows, view obstructions, and the lonely runner
- On the chromatic number of circulant graphs
- View-obstruction: a shorter proof for 6 lonely runners
- On a conjecture in diophantine approximations. II
- Lonely runner polyhedra
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- On the time for a runner to get lonely
- Regular chromatic number and the lonely runner problem
- On a conjecture in diophantine approximations. III
- View-obstruction problem for 3-dimensional spheres
- View-Obstruction Problems. II
This page was built for publication: Untere Schranken für zwei diophantische Approximations-Funktionen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553463)