University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Forbidden spiders: A forbidden substructure characterisation of temporal planarity

Forbidden spiders: A forbidden substructure characterisation of temporal planarity

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dr. Jan Kurkofka.

Many topoligcal properties of combinatorial objects can be characterised by the forbidden substructures. In this talk we will explore a temporal analogue of planar graphs and prove a forbidden substructure result.

Given a graph $G$, we can obtain a \emph{minor} $H$ of $G$ by deleting and contracting edges from $G$. A \emph{temporal sequence} is a sequence of graphs $(G_1,\ldots,G_n)$ such that $G_i$ is a graph minor of $G_{i+1}$, or $G_{i+1}$ is a graph minor of $G_i$ for each $i\in[n-1]$. A temporal sequence generalises the notion of a temporal graph; indeed, a temporal graph can be thought of as a temporal sequence where the minor operations are only deletions.

Given a temporal sequence $(G)=(G_1,\ldots,G_n)$, we say that a sequence of planar embeddings $I=(\iota_i:G_i\hookrightarrow S^2)$ is a \emph{simultaneous embedding} of $(G)$ if the embeddings are `compatible with respect to the minor relations’. We will investigate when a temporal sequence has a simultaneous embedding.

This will be difficult in general, but we will be able to provide characterisations for some classes of temporal sequence.

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.