首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Finding Convex Sets in Convex Position
Authors:Géza Tóth
Institution:DIMACS Center, Rutgers University and Rényi Intitute of Mathematics, Hungarian Academy of Sciences; H–1364 Budapest, P.O. Box 127, Hungary; E-mail: geza@renyi.hu, HU
Abstract:Let F{\cal{F}} denote a family of pairwise disjoint convex sets in the plane. F{\cal{F}} is said to be in convex position, if none of its members is contained in the convex hull of the union of the others. For any fixed k 3 5k\ge5, we give a linear upper bound on Pk(n)P_k(n), the maximum size of a family F{\cal{F}} with the property that any k members of F{\cal{F}} are in convex position, but no n are.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号