Published online by Cambridge University Press: 17 June 2019
We enrich the structure of finite simple graphs with a linear order on either the vertices or the edges. Extending the standard question of Turan-type extremal graph theory we ask for the maximal number of edges in such a vertex or edge ordered graph on n vertices that does not contain a given pattern (or several patterns) as a subgraph. The forbidden subgraph itself is also a vertex or edge ordered graph, so we forbid a certain subgraph with a specified ordering, but we allow the same underlying subgraph with a different (vertex or edge) order. This allows us to study a large number of extremal problems that are not expressible in the classical theory. In this survey we report ongoing research. For easier access, we include sketches of proofs of selected results.
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.
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.
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.