Title
Finding Convex Sets in Convex Position
Abstract
Let ${\cal F}$ denote a family of pairwise disjoint convex sets in the plane. ${\cal F}$ is said to be in {\em convex position}, if none of its members is contained in the convex hull of the union of the others. For any fixed $k\geq 5$, we give a linear upper bound on $P_k(n)$, the maximum size of a family ${\cal F}$ with the property that any $k$ members of ${\cal F}$ are in convex position, but no $n$ are.
Year
DOI
Venue
2000
10.1007/s004930070010
Combinatorica
Keywords
Field
DocType
finding convex sets,convex position,convex hull,cal f,pairwise disjoint convex set,maximum size,em convex position,convex set,upper bound
Discrete mathematics,Combinatorics,Convex combination,Convex hull,Convex set,Subderivative,Convex polytope,Proper convex function,Convex position,Convex analysis,Mathematics
Journal
Volume
Issue
ISSN
20
4
0209-9683
Citations 
PageRank 
References 
1
0.36
1
Authors
1
Name
Order
Citations
PageRank
Géza Tóth1729.25