2013 | OriginalPaper | Chapter
The Beginnings of Geometric Graph Theory
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Geometric graphs (topological graphs) are graphs drawn in the plane with possibly crossing straight-line edges (resp., curvilinear edges). Starting with a problem of Heinz Hopf and Erika Pannwitz from 1934 and a seminal paper of Paul Erdős from 1946, we give a biased survey of Turán-type questions in the theory of geometric and topological graphs. What is the maximum number of edges that a geometric or topological graph of
n
vertices can have if it contains no forbidden subconfiguration of a certain type? We put special emphasis on open problems raised by Erdős or directly motivated by his work.