A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon
type: Item
instance of: scholarly article
zbMATH Open document ID: 1307.52010
author: Liping Wu
author: Wanbing Lu
publication date: 2014-10-29T00:00:00Z
full work available at URL: 8056.htm
Mathematics Subject Classification ID: 52C10
zbMATH DE Number: 6362477
zbMATH Keywords: convex polygon
zbMATH Keywords: Erdős-Szekeres theorem
zbMATH Keywords: disjoint pair
MaRDI profile type: Publication
title: A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon
published in: Advances and Applications in Discrete Mathematics
review text: The paper introduces a new variant of the Erdős-Szekeres theorem: what is the smallest number (denoted by \(N(k,\ell)\)) such that for any \(N(k,\ell)\) points in the plane with no 3 of them collinear, is guaranteed to have a disjoint pair of convex \(k\)-gon and convex \(\ell\)-gon? The paper shows that \(17\leq N(4,6)\leq 21\).
reviewed by: László A. Székely
description: scientific article; zbMATH DE number 6362477