On balanced 4-holes in bichromatic point sets
- 1 March 2015
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 48 (3) , 169-179
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- MEC (MTM2009-08652)
- MEC (MTM2009-08652)
- ESF (EUI-EURC-2011-4306)
- CONACyT (153984)
- CONICYT (11110069)
- MEC (MTM2009-08652)
- CONACyT (178379)
- JSPS (24540144)
- MEC (MTM2009-08652)
This publication has 9 references indexed in Scilit:
- Balanced 6-holes in linearly separable bichromatic point setsElectronic Notes in Discrete Mathematics, 2013
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-GonsSIAM Journal on Discrete Mathematics, 2010
- On Erdős-Szekeres-type problemsElectronic Notes in Discrete Mathematics, 2009
- Empty Convex Hexagons in Planar Point SetsDiscrete & Computational Geometry, 2007
- The Empty Hexagon TheoremDiscrete & Computational Geometry, 2007
- Chromatic variants of the Erdos–Szekeres theorem on points in convex positionComputational Geometry, 2003
- Lower bounds on the number of crossing-free subgraphs of KNComputational Geometry, 2000
- Counting convex polygons in planar point setsInformation Processing Letters, 1995
- Sets with No Empty Convex 7-GonsCanadian Mathematical Bulletin, 1983