A geometric graph is a graph drawn in the plane such that the vertex set is a set of (non-colinear) points and every edge is a straight-line segment joining two vertices. In this talk I will discuss a few known results on ramsey-type problems for geometric graphs and some conjectures and recent progress towards these conjectures. This talk will be given informally.
Jane Gao, 02/17/2011 11:10
Jane Gao, 01/31/2011 13:01
Jane Gao, 01/31/2011 12:59 -- Created document.