View-obstruction problems in n-dimensional geometry
From MaRDI portal
Publication:2264801
DOI10.1016/0097-3165(74)90066-1zbMATH Open0273.10025OpenAlexW2081866677MaRDI QIDQ2264801FDOQ2264801
Authors: Thomas W. Cusick 
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90066-1
Cites Work
Cited In (22)
- LONELY RUNNERS IN FUNCTION FIELDS
- 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 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
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- Density of sets with missing differences and applications
- Sequences of integers with three missing separations
- 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
- A Markoff-type chain for the view-obstruction problem for spheres in \(\mathbb{R}^ 4\)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Maximal density of integral sets with missing differences and the kappa values
- On a conjecture in diophantine approximations. III
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- Title not available (Why is that?)
- View-obstruction problem for 3-dimensional spheres
- View-Obstruction Problems. II
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)
