Abstract
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a Kr subgraph for some given r? Or at least a Kr minor? Will some sufficiently high average degree or chromatic number ensure that one of these substructures occurs?
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Reinhard Diestel
About this chapter
Cite this chapter
Diestel, R. (2017). Extremal Graph Theory. In: Graph Theory. Graduate Texts in Mathematics, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53622-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-53622-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-53621-6
Online ISBN: 978-3-662-53622-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)