O. Aichholzar, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber, Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.2147-2155, 2009.
DOI : 10.1137/090767947

D. Avis, K. Hosono, and M. Urabe, On the Existente of a Point Subset with 4 or 5 Interior Points, Japanese Conference on Discrete and Computational Geometry, pp.57-64, 1998.
DOI : 10.1007/978-3-540-46515-7_5

D. Avis, K. Hosono, and M. Urabe, On the existence of a point subset with a specified number of interior points, Discrete Mathematics, vol.241, issue.1-3, pp.33-40, 2001.
DOI : 10.1016/S0012-365X(01)00108-X

I. Barany and G. Karolyi, Problems and Results around the Erd??s-Szekeres Convex Polygon Theorem, Japanese Conference on Discrete and Computational Geometry, pp.91-105, 2001.
DOI : 10.1007/3-540-47738-1_7

J. Beck, Combinatorial Games: Tic-Tac-Toe Theory, 2008.
DOI : 10.1017/CBO9780511735202

M. Bednarska and T. Luczak, Biased Positional Games for Which Random Strategies are Nearly Optimal, Combinatorica, vol.20, issue.4, pp.477-488, 2000.
DOI : 10.1007/s004930070002

V. Chvátal and P. Erd?-os, Biased Positional Games, Ann. Discrete Math, vol.2, pp.221-228, 1978.
DOI : 10.1016/S0167-5060(08)70335-2

O. Devillers, F. Hurtado, G. Karolyi, and C. Seara, Chromatic variants of the Erdo??s???Szekeres theorem on points in convex position, Computational Geometry, vol.26, issue.3, pp.193-208, 2003.
DOI : 10.1016/S0925-7721(03)00013-0

P. Erd?-os, Some more problems on elementary geometry, Austral. Math. Soc. Gaz, vol.103, issue.1, pp.99-108, 1978.

P. Erd?-os and G. Szekeres, A combinatorial problem in geometry, Compositio Math, vol.2, pp.463-470, 1935.

T. Fevens, A Note on Point Subsets with a Specified Number of Interior Points, Japanese Conference on Discrete and Computational Geometry, pp.152-158, 2002.
DOI : 10.1007/978-3-540-44400-8_15

H. Gebauer and T. Szabó, Asymptotic random graph intuition for the biased connectivity game. Random Structures and Algorithms, pp.431-443, 2009.

T. Gerken, Empty Convex Hexagons in Planar Point Sets, Discrete & Computational Geometry, vol.29, issue.4, pp.239-272, 2008.
DOI : 10.1007/s00454-007-9018-x

H. Harborth, Konvexe Funfecke in ebenen Punktmengen, Elem. Math, vol.33, issue.5, pp.116-118, 1978.

D. Hefetz, M. Krivelevich, M. Stojakovi´cstojakovi´c, and T. Szabó, Fast winning strategies in Maker???Breaker games, Journal of Combinatorial Theory, Series B, vol.99, issue.1, pp.39-47, 2009.
DOI : 10.1016/j.jctb.2008.04.001

J. D. Horton, Sets with no empty convex $7$-gons, Bulletin canadien de math??matiques, vol.26, issue.4, pp.482-484, 1983.
DOI : 10.4153/CMB-1983-077-8

K. Hosono, On the existence of a convex point subset containing one triangle in the plane, Discrete Mathematics, vol.305, issue.1-3, pp.201-218, 2005.
DOI : 10.1016/j.disc.2005.07.006

D. Kleitman and L. Pachter, Finding Convex Sets Among Points in the Plane, Discrete & Computational Geometry, vol.19, issue.3, pp.405-410, 1998.
DOI : 10.1007/PL00009358

V. A. Koshelev, On the Erd? os-Szekeres type problem in combinatorial geometry, Discrete mathematics, vol.29, pp.175-177, 2007.

M. Krivelevich and T. Szabó, Biased positional games and small hyper graphs with large covers, Electronic Journal of Combinatorics, vol.15, issue.1, p.70, 2008.

X. Lu, A note on biased and non-biased games, Discrete Applied Mathematics, vol.60, issue.1-3, pp.285-291, 1995.
DOI : 10.1016/0166-218X(94)00059-M

W. Morris and V. Soltan, The Erd??s-Szekeres problem on points in convex position -- a survey, Bulletin of the American Mathematical Society, vol.37, issue.04, pp.437-458, 2000.
DOI : 10.1090/S0273-0979-00-00877-6

C. M. Nicolas, The Empty Hexagon Theorem, Discrete & Computational Geometry, vol.38, issue.2, pp.389-397, 2007.
DOI : 10.1007/s00454-007-1343-6

M. H. Overmars, Finding Sets of Points without Empty Convex 6-Gons, Discrete and Computational Geometry, vol.29, issue.1
DOI : 10.1007/s00454-002-2829-x

J. D. Kalbfeisch, J. G. Kalbfeisch, and R. G. Stanton, A combinatorial problem on convex regions, Proceedings of Louisiana conference on Combinatorics, Graph theory and computing, pp.180-188, 1970.

G. Szekeres and L. Peters, Computer solution to the 17-point Erd??s-Szekeres problem, The ANZIAM Journal, vol.52, issue.02, pp.151-164, 2006.
DOI : 10.1090/S0273-0979-00-00877-6

G. Toth and P. Valtr, The Erd? os-Szekeres theorem: upper bounds and related results. InCombinatorial and Computational Geometry, pp.557-568, 2005.

P. Valtr, Sets in Rd with no large empty convex subsets, Discrete Mathematics, vol.108, issue.1-3, pp.115-12428, 1992.
DOI : 10.1016/0012-365X(92)90665-3

X. Wei and R. Ding, More on an Erd??s???Szekeres-Type Problem for Interior Points, Discrete & Computational Geometry, vol.83, issue.4, pp.640-653, 2009.
DOI : 10.1007/s00454-008-9090-x