View-obstruction problems in n-dimensional geometry
From MaRDI portal
Publication:2264801
Cites work
Cited in
(22)- View-Obstruction Problems. II
- The view-obstruction problem for \(n\)-dimensional cubes
- Regular chromatic number and the lonely runner problem
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- On a conjecture in diophantine approximations. II
- Sequences of integers with three missing separations
- Density of sets with missing differences and applications
- Maximal density of integral sets with missing differences and the kappa values
- View-obstruction problem for 3-dimensional spheres
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- View-obstruction problems. III
- LONELY RUNNERS IN FUNCTION FIELDS
- On a conjecture in diophantine approximations. III
- On the chromatic number of circulant graphs
- A Markoff-type chain for the view-obstruction problem for spheres in \(\mathbb{R}^ 4\)
- On the time for a runner to get lonely
- Flows, view obstructions, and the lonely runner
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\)
- View-obstruction: a shorter proof for 6 lonely runners
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- scientific article; zbMATH DE number 7069664 (Why is no real title available?)
This page was built for publication: View-obstruction problems in \(n\)-dimensional geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264801)
