Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-17T17:00:03.540Z Has data issue: false hasContentIssue false

Geometric Graph Theory

Published online by Cambridge University Press:  05 May 2013

János Pach
Affiliation:
University of New York
J. D. Lamb
Affiliation:
University of Kent, Canterbury
D. A. Preece
Affiliation:
University of Kent, Canterbury
Get access

Summary

Summary A geometric graph is a graph drawn in the plane such that its vertices are points in general position and its edges are straight-line segments. The study of geometric graphs is a fairly new discipline abounding in open problems, but it has already yielded some striking results that have proved to be instrumental for the solution of various problems in combinatorial and computational geometry. These include the k-set problem, proximity questions, bounding the number of incidences between points and lines, designing various efficient graph drawing algorithms, etc. This paper surveys some Turán-type and Ramsey-type extremal problems for geometric graphs, and discusses their generalizations and applications.

Introduction, basic definitions

Let G be a finite graph with no loops or multiple edges, whose vertex set and edge set are denoted by V(G) and E(G), respectively. By a drawing of G we mean a representation of G in the plane such that each vertex is represented by a distinct point and each edge by a simple (non-self-intersecting) continuous arc connecting the corresponding two points. If it is clear that we are referring to a drawing, and not to the underlying “abstract” graph, these points and arcs will also be called vertices and edges, respectively.

Two edges (arcs) cross each other if they have an interior point in common. This point is called a crossing. A crossing p is called proper if in a small neighbourhood of p one edge passes from one side of the other edge to the other side.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Geometric Graph Theory
  • Edited by J. D. Lamb, University of Kent, Canterbury, D. A. Preece, University of Kent, Canterbury
  • Book: Surveys in Combinatorics, 1999
  • Online publication: 05 May 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721335.007
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Geometric Graph Theory
  • Edited by J. D. Lamb, University of Kent, Canterbury, D. A. Preece, University of Kent, Canterbury
  • Book: Surveys in Combinatorics, 1999
  • Online publication: 05 May 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721335.007
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Geometric Graph Theory
  • Edited by J. D. Lamb, University of Kent, Canterbury, D. A. Preece, University of Kent, Canterbury
  • Book: Surveys in Combinatorics, 1999
  • Online publication: 05 May 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721335.007
Available formats
×