Abstract
Motivated by a question raised by Pór and Wood in connection with compact embeddings of graphs in \({\mathbb Z}^d\), we investigate generalizations of the no-three-in-line-problem. For several pairs (k,l) we give algorithmic lower, and upper bounds on the largest sizes of subsets S of grid-points from the d-dimensional T × ⋯ ×T-grid, where no l distinct grid-points of S are contained in a k-dimensional affine or linear subspace.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ajtai, M., Komlós, J., Pintz, J., Spencer, J., Szemerédi, E.: Extremal Uncrowded Hypergraphs. J. Comb. Theory Ser. A 32, 321–335 (1982)
Bárány, I., Harcos, G., Pach, J., Tardos, G.: Covering Lattice Points by Subspaces. Per. Math. Hung. 43, 93–103 (2001)
Bertram–Kretzberg, C., Lefmann, H.: The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM J. on Comput. 29, 201–230 (1999)
Brass, P., Knauer, C.: On Counting Point-Hyperplane Incidences. Comp. Geo. 25, 13–20 (2003)
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry, pp. 417–421. Springer, Heidelberg (2005)
Cohen, R.-F., Eades, P., Lin, T., Ruskey, F.: Three-Dimensional Graph Drawing. Algorithmica 17, 199–208 (1996)
Dudeney, H.E.: Amusements in Mathematics, Nelson, London, pp. 94–222 (1917)
Duke, R.A., Lefmann, H., Rödl, V.: On Uncrowded Hypergraphs. Rand. Struct. & Algorithms 6, 209–212 (1995)
Erdős, P., Graham, R.L., Rusza, I., Taylor, H.: Bounds for Arrays of Dots with Distinct Slopes or Lengths. Combinatorica 12, 39–44 (1992)
Erdös, P., Roth, K.-F.: On a Problem of Heilbronn. J. London Math. Soc. 26, 198–204 (1951)
Flammenkamp, A.: Progress in the No-three-in-a-Line-Problem. J. Comb. Theory, Ser. A 60, 305–311 (1992)
Flammenkamp, A.: Progress in the No-three-in-a-Line-Problem. II. J. Comb. Theory, Ser. A 81, 108–113 (1998)
Füredi, Z.: Maximal Independent Subsets in Steiner Systems and in Planar Sets. SIAM J. Disc. Math. 4, 196–199 (1991)
Golomb, S.W.: Construction of Signals with Favourable Correlation Properties. Surveys in Combinatorics, London Mathematical Society LNS 166, 1–39 (1991)
Golomb, S.W., Taylor, H.: Two-dimensional Synchronization Patterns for Minimum Ambiguity. IEEE Transactions Information Theory IT-28, 600–604 (1982)
Guy, R.: Unsolved Problems in Number Theory, 2nd edn. Springer, Heidelberg (1994)
Pach, J., Thiele, T., Tóth, G.: Three Dimensional Grid Drawings of Graphs. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Math. 223, pp. 251–255. AMS (1999)
Pór, A., Wood, D.W.: No-Three-in-Line-in-3D. Algorithmica 47, 481–488 (2007)
Spencer, J.: Turán’s Theorem for k-Graphs. Disc. Math. 2, 183–186 (1972)
Thiele, T.: Geometric Selection Problems and Hypergraphs, PhD thesis, FU Berlin (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lefmann, H. (2008). No l Grid-Points in Spaces of Small Dimension . In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)