Linear Beer-index bound for p-componentwise simply Δ-connected sets
Linear Beer-index bound for p-componentwise simply Δ-connected sets
Call a set p-componentwise simply -connected if, for every triangle with , one has . Assume that is defined. The linear-bound conjecture. There is an absolute constant such that
This would extend the linear upper bound proved in the paper for p-componentwise simply connected planar sets to the weaker -connectedness assumption.
Sources & referencesView supporting material
Primary source
Martin Balko, Vít Jelínek, Pavel Valtr and Bartosz Walczak, “On the Beer index of convexity and its variants”, arXiv:1412.1769 (2016).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.