Mason Archival Repository Service

Extremal Combinatorics in Geometry and Graph Theory

Show simple item record

dc.contributor.advisor Morris, Walter D.
dc.contributor.author Beagley, Jonathan Edward
dc.creator Beagley, Jonathan Edward en_US
dc.date.accessioned 2013-08-09T15:39:27Z
dc.date.available 2013-08-09T15:39:27Z
dc.date.issued 2013 en_US
dc.identifier.uri https://hdl.handle.net/1920/8259
dc.description.abstract We study a problem in extremal geometry posed by Paul Erdos and George Szekeres in 1935. This problem is to find the smallest positive integer <italic>N(n)</italic> such that every point set in general position (no three on a line) of <italic>N(n)</italic> points contains the vertex set of a convex <italic>n</italic>-gon. Erdos and Szekeres showed that <italic>N(n)</italic> exists and conjectured that <italic>N(n)</italic> = 2<super><italic>n</italic>-2</super> + 1. In 2006, Walter Morris introduced a graph on the copoints of a planar point set in general position, where cliques in the graph correspond to subsets of points in convex position, and showed that the chromatic number of the copoint graph was <italic>n</italic> if the point set contained at least 2<super><italic>n</italic>-2</super> + 1 points. We extend this copoint graph to abstract convex geometries studied by Edelman and Jamison, where the cliques of this graph are convexly independent sets. A major goal of this dissertation is to study the clique and chromatic numbers for the copoint graph of convex geometries. Much of this dissertation would be trivial if every graph were a copoint graph, so we provide a family of graphs that are not copoint graphs for any convex geometries.
dc.format.extent 57 pages en_US
dc.language.iso en en_US
dc.rights Copyright 2013 Jonathan Edward Beagley en_US
dc.subject Mathematics en_US
dc.subject convex geometry en_US
dc.subject copoint graph en_US
dc.subject Erdos-Szekeres Problem en_US
dc.subject graph coloring en_US
dc.subject Happy Ending Problem en_US
dc.subject order dimension en_US
dc.title Extremal Combinatorics in Geometry and Graph Theory en_US
dc.type Dissertation en
thesis.degree.level Doctoral en
thesis.degree.discipline Mathematics en
thesis.degree.grantor George Mason University en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Browse

My Account

Statistics