# Contents

Please don’t tamper with this article for a little while – I want to make more edits soon and not have the flow interrupted.

## Idea

Let $G$ and $H$ be simple graphs. Then $H$ is a graph minor of $G$ if it is isomorphic to a graph obtained by applying a sequence of operations of the following sort, starting from $G$:

• Removing edges;

• Removing isolated points;

• Contracting edges, where contracting an edge means removing it and identifying its endpoints.

Graph minors can be viewed as certain types of subquotients in an appropriate category of graphs; this article describes which subquotients those are in categorical language.

###### Disclaimer

To be honest, it’s not really clear how a categorical POV (or at least the POV presented here) can usefully inform or guide or clarify graph theory. For the time being, we are just collecting some notes. No deep theorems of graph theory are proved here. The main observation is simply that graphs form a category with very good properties, and there may be potential of putting those properties to effective use some day.

## Categorical POV

We take the point of view that a simple graph (consisting of a set of vertices $V$ and a collection of two-element subsets of $V$ called “edges”) carries the same information as a set $V$ equipped with a reflexive symmetric relation $E$, and that a morphism of simple graphs should be defined as a function between the vertex-sets which respects such relations. Indeed, such a relation determines and is uniquely determined by a simple graph $G$ where for given vertices $x, y \in V$, there is an edge $\{x, y\}$ between $x$ and $y$ in $G$ iff both $(x, y) \in E$ and $x \neq y$. We will write $E(x, y)$ to mean $(x, y) \in E$.

###### Remark

Since edges are $2$-element subsets, it might seem more natural to interpret a simple graph as a set $V$ equipped with a symmetric irreflexive relation $E$, whereby $E(x, x)$ is false for all $x \in V$. But the result is a rather poor category which lacks certain morphisms we would like, such as edge contractions, at least if we take the morphisms $(V, E) \to (W, F)$ to be functions $f: V \to W$ which preserve those relations. Indeed, we could never have both $E(x, y)$ and $f(x) = f(y)$ since irreflexivity of $F$ would render $F(f(x), f(y))$ false. Thus, requiring reflexivity is the more flexible option.

Notice that contraction of edges yields a quotient in this category. For example, if we want to contract a collection of edges by identifying certain points along an equivalence relation $R$, that is via some quotient map $q: V \to V/R$, then we simply take the image of the composite

$E \hookrightarrow V \times V \stackrel{q \times q}{\to} V/R \times V/R;$

notice this image is a reflexive symmetric relation on $V/R$.

Thus, we let $SimpGph$ denote the category of sets equipped with a reflexive symmetric relation. This category is convenient in many respects (for details see category of simple graphs):

###### Theorem

The category $SimpGph$ has the following properties.

• It is a Grothendieck quasitopos. In particular, both it and its opposite $SimpGph^{op}$ are regular categories.

• It is an $\infty$-extensive category.

• The forgetful functor $\Gamma = \hom(1, -): SimpGph \to Set$ is faithful and exhibits $SimpGph$ as a topological concrete category.

• $SimpGph$ is cohesive: the adjoint string $\Delta \dashv \Gamma \dashv \nabla: Set \to SimpGph$ has a further left adjoint $\Pi \dashv \Delta$, and $\Pi: SimpGph \to Set$ preserves products.

Of course $\Delta$ assigns to a set $X$ the discrete graph on $X$ (the minimal reflexive relation $\delta_X \hookrightarrow X \times X$), and $\nabla$ the codiscrete graph (the maximal relation $1_{X \times X}$), while $\Pi(G)$ is the set of connected components of $G$. Let $\gamma: 1 \to \Delta \Pi$ denote the unit of $\Pi \dashv \Delta$; the component $\gamma G: G \to \Delta \Pi (G)$ takes a vertex $v \in G$ to the connected component to which it belongs. Notice that $\gamma G$ is a regular epi.

###### Definition

A contraction map between simple graphs is a morphism $\pi: G \to G'$ that arises by pushing out a map of the form $\gamma K$ along some map $f: K \to G$:

$\array{ K & \stackrel{f}{\to} & G \\ \mathllap{\gamma K} \downarrow & po & \downarrow \mathrlap{\pi} \\ \Pi(K) & \to & G' }$

is a pushout square. If $G \to G'$ is a contraction map, we also say $G'$ is a contraction of $G$.

It is immediate that a contraction map is a regular epi, since every $\gamma K$ is regular epi.

###### Proposition

Contraction maps are closed under composition.

###### Definition

A graph $H$ is a minor of a graph $G$ if it arises as a subobject of some contraction of $G$:

$\array{ & & G \\ & & \downarrow \mathrlap{contraction} \\ H & \rightarrowtail & G' }$
###### Proposition

The subquotient relation is reflexive and transitive.

###### Proof

Reflexivity is clear. For transitivity, we compose subquotients by taking a pushout square as follows.

$\array{ G & \twoheadrightarrow & G' & \twoheadrightarrow & G'' \\ & & ^\mathllap{mono} \uparrow & & \uparrow^\mathrlap{mono} \\ & & H & \twoheadrightarrow & H' \\ & & & & \uparrow^\mathrlap{mono} \\ & & & & J }$

where we use the simple fact that the pushout of a mono along an arrow in $SimpGph$ is a mono (because $Vert$ reflects monos and preserves monos and pushouts, plus the fact that the pushout of a mono in $Set$ is a mono).

For finite graphs, the subquotient relation is also antisymmetric (if $G$ and $H$ are minors of one another, then they are isomorphic). Indeed, if either the arrow $G \twoheadrightarrow G'$ or the arrow $H \hookrightarrow G'$ is not an isomorphism, then $H$ has strictly fewer edges and vertices than $G$. This is clearly not the case for infinite graphs (e.g., the infinite rooted binary tree without leaves contains as a subgraph a disjoint sum of two copies of itself).

(I intend to expand this section, eventually. Hopefully one can develop a categorical story about graph minors in particular.)

## Minor-closed families

• The collection of forests? is closed under the graph minor relation.

• The collection of planar graphs? is closed under the graph minor relation.

## Graph minor theorem

This celebrated result of Robertson and Seymour says that no collection of finite graphs, ordered by the graph minor relation, has an infinite antichain. Equivalently, that in any collection of finite graphs, there are only finitely many elements which are minimal with respect to the graph minor relation.

As a corollary, any class $F$ of finite graphs which is closed under minors admits a forbidden minor characterization: is precisely the class of graphs which do not have any members of a specific finite family of graphs as a minor. (Proof: the complement of $F$ in the poset of finite graphs has finitely many minimal members. Then, $x$ belongs to $F$ iff none of these minimal members occurs as a minor of $x$.

For example, the class of forests is precisely the class of finite graphs which do not have a triangle $K_3$ as a minor. The class of planar graphs is precisely the class of finite graphs which do not have $K_5$ or $K_{3, 3}$ as a minor.

Forbidden minor characterizations also exist for certain classes of matroids. (See for example Wikipedia here.)

## References

• Wikipedia article on graph minors (link)

Last revised on June 13, 2017 at 06:17:50. See the history of this page for a list of all contributions to it.