G. L. Alexanderson, L. F. Klosinski, and L. C. Larson, The 1979 Putnam Exam. The William Lowell Putnam Mathematical Competition problems and solutions, pp.1965-1984, 1985.

N. Alon and P. , Disjoint edges in geometric graphs, Discrete & Computational Geometry, vol.53, issue.2, pp.287-290, 1989.
DOI : 10.1007/BF02187731

P. Brass, G. Károlyi, and P. Valtr, A Tur??n-type Extremal Theory of Convex Geometric Graphs, Discrete and Computational Geometry, pp.275-300, 2003.
DOI : 10.1007/978-3-642-55566-4_12

V. I. Benediktovich, Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph, Electronic Notes in Discrete Mathematics, vol.24, pp.31-38, 2006.
DOI : 10.1016/j.endm.2006.06.006

]. J. Cern´ycern´y, Geometric Graphs with No Three Disjoint Edges, Discrete & Computational Geometry, vol.34, issue.4, pp.679-695, 2005.
DOI : 10.1007/s00454-005-1191-1

P. Erd?-os, On Sets of Distances of n Points, The American Mathematical Monthly, vol.53, issue.5, pp.248-250, 1946.
DOI : 10.2307/2305092

S. Felsner, Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, 2004.
DOI : 10.1007/978-3-322-80303-0

A. García, C. Hernando, F. Hurtado, M. Noy, and J. , Packing trees into planar graphs, Journal of Graph Theory, vol.17, issue.3, pp.172-181, 2002.
DOI : 10.1002/jgt.10042

W. Goddard, M. Katchalski, and D. J. Kleitman, Forcing Disjoint Segments in the Plane, European Journal of Combinatorics, vol.17, issue.4, pp.391-395, 1996.
DOI : 10.1006/eujc.1996.0032

F. Harary, THE MAXIMUM CONNECTIVITY OF A GRAPH, Proceedings of the National Academy of Sciences, vol.48, issue.7, pp.1142-1146, 1962.
DOI : 10.1073/pnas.48.7.1142

C. Hernando, F. Hurtado, and M. Noy, Graphs of Non-Crossing Perfect Matchings, Graphs and Combinatorics, vol.18, issue.3, pp.517-532, 2002.
DOI : 10.1007/s003730200038

G. Károlyi, J. Pach, and G. Tóth, Ramsey-type results for geometric graphs, I. Discrete and Computational Geometry 18, pp.247-255, 1997.

G. Károlyi, J. Pach, G. Tóth, and P. Valtr, Ramsey-type results for geometric graphs, II. Discrete and Computational Geometry 20, pp.375-388, 1998.

Y. S. Kupitz, On Pairs of Disjoint Segments in Convex Position in The Plane, Convexity and graph theory, pp.203-208, 1984.
DOI : 10.1016/S0304-0208(08)72827-5

Y. S. Kupitz and M. A. Perles, Extremal theory for convex matchings in convex geometric graphs, Discrete & Computational Geometry, vol.48, issue.2, pp.195-220, 1996.
DOI : 10.1007/BF02717731

E. L. Lloyd, On triangulations of a set of points in the plane, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.228-240, 1977.
DOI : 10.1109/SFCS.1977.21

C. Merino, G. Salazar, and J. Urrutia, On the length of longest alternating paths for multicoloured point sets in convex position, Discrete Mathematics, vol.306, issue.15, pp.1791-1797, 2006.
DOI : 10.1016/j.disc.2006.03.035

J. Pach, Geometric graph theory, Surveys in Combinatorics, pp.167-200, 1999.
DOI : 10.1201/9781420035315.ch10

J. Pach and J. , Tör? ocsik, Some geometric applications of Dilworth's theorem. Discrete and Computational Geometry 12, pp.1-7, 1994.

D. Sitton, Maximum matchings in complete multipartite graphs, Furman University Electronic Journal of Undergraduate Mathematics, vol.2, pp.6-16, 1996.

G. Tóth, Note on Geometric Graphs, Journal of Combinatorial Theory, Series A, vol.89, issue.1, pp.126-132, 2000.
DOI : 10.1006/jcta.1999.3001

G. Tóth and P. Valtr, Geometric graphs with few disjoint edges, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.633-642, 1999.
DOI : 10.1145/276884.276905