Abstract
Consider an n-point set X ⊂ R d, and fix an integer k. Call a k-point subset S ⊆ X a k-set of X if there exists an open half-space γ such that S = X ∩ γ; that is, S can be “cut off” by a hyperplane. In this chapter we want to estimate the maximum possible number of k-sets of an n-point set in R d, as a function of n and k.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Matoušek, J. (2002). Attempts to Count k-Sets. In: Matoušek, J. (eds) Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0039-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0039-7_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95374-8
Online ISBN: 978-1-4613-0039-7
eBook Packages: Springer Book Archive