arXiv Analytics

Sign in

arXiv:1711.04232 [math.CO]AbstractReferencesReviewsResources

Pairs of disjoint cycles

Serguei Norine, Robin Thomas, Hein van der Holst

Published 2017-11-12Version 1

Let $G=(V,E)$ be a finite undirected graph. Let $\mathbb{Z}\langle V\rangle$ denote free $\mathbb{Z}$-module generated by the vertices of $G$. Let $\mathbb{Z}\langle E\rangle$ denote the free $\mathbb{Z}$-module generated by the oriented edges of $G$. A $2$-cycle of $G$ is a bilinear form $d : \mathbb{Z}\langle E\rangle\times \mathbb{Z}\langle E\rangle\to \mathbb{Z}$ such for each edge $e$ of $G$, $d(e,\cdot)$ and $d(\cdot,e)$ are circulations, and $d(e,f) = 0$ whenever $e$ and $f$ have a common vertex. The $2$-cycles of a graph $G$ are in one-to-one correspondence with the homology classes in the second homology group of the deleted product of $G$. We show that each $2$-cycle is a linear combination of three special types of $2$-cycles: cycle-pair $2$-cycles, Kuratowski $2$-cycles, and quad $2$-cycles. Furthermore, we show that each skew-symmetric $2$-cycles is a linear combination of two special types of $2$-cycles: skew-symmetric cycle-pair $2$-cycles and skew-symmetric quad $2$-cycles.

Related articles: Most relevant | Search more
arXiv:1905.00239 [math.CO] (Published 2019-05-01)
An Ore-type condition for existence of two disjoint cycles
arXiv:1002.1492 [math.CO] (Published 2010-02-07)
Books vs Triangles
arXiv:1010.6278 [math.CO] (Published 2010-10-29)
Random graphs with few disjoint cycles