A closed (n+1)-convex set in R^ 2 is a union of n^ 6 convex sets
From MaRDI portal
Publication:919620
It is shown that if a closed set S in the plane is \(n+1\)-convex, then it has no more than \(n^ 4\) holes. As a consequence, it can be covered by \(\leq n^ 6\) convex subsets. This is an improvement on the bound of \(2^ n\cdot n^ 3\) obtained by \textit{M. Breen} and \textit{D. C. Kay} [Israel J. Math. 24, 217-233 (1976; Zbl 0342.52006)].
Recommendations
Cites work
Cited in
(13)- Sets in a Euclidean space which are not a countable union of convex subsets
- Convex decompositions in the plane and continuous pair colorings of the irrationals
- A planar 3-convex set is indeed a union of six convex sets
- On visibility and covering by convex sets
- Exact hyperplane covers for subsets of the hypercube
- Finite sets as complements of finite unions of convex sets
- On the convex components of a set in \(\mathbb{R}^n\)
- scientific article; zbMATH DE number 165066 (Why is no real title available?)
- More on convexity numbers of closed sets in ℝⁿ
- Convex decompositions and the valence of some functions
- On three measures of non-convexity
- Cantor-Bendixson degrees and convexity in \(\mathbb{R}^2\)
- Integer-valued valuations
This page was built for publication: A closed \((n+1)\)-convex set in \({\mathbb{R}}^ 2\) is a union of \(n^ 6\) convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q919620)
