On 2-cycles of graphs

DOI10.1016/J.JCTB.2023.06.003MaRDI QIDQ6170796zbMATH OpenFDO

Authors Serguei Norine, Robin Thomas, Hein van der Holst

Publication date 10 August 2023

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.04232

zbMATH Keywords

configuration spacedeleted productlinkless embedding

Mathematics Subject Classification ID

Paths and cycles (05C38) Discriminantal varieties and configuration spaces in algebraic topology (55R80)

Abstract: Let $G=(V,E)$ be a finite undirected graph. Orient the edges of $G$ in an arbitrary way. A $2$-cycle on $G$ is a function $d:E^{2}omathbbZ$ such for each edge $e$, $d(e,cdot)$ and $d(cdot,e)$ are circulations on $G$, and $d(e,f)=0$ whenever $e$ and $f$ have a common vertex. We show that each $2$-cycle is a sum of three special types of $2$-cycles: cycle-pair $2$-cycles, Kuratowski $2$-cycles, and quad $2$-cycles. In case that the graph is Kuratowski connected, we show that each $2$-cycle is a sum of cycle-pair $2$-cycles and at most one Kuratowski $2$-cycle. Furthermore, if $G$ is Kuratowski connected, we characterize when every Kuratowski $2$-cycle is a sum of cycle-pair $2$-cycles. A $2$-cycles $d$ on $G$ is skew-symmetric if $d(e,f)=-d(f,e)$ for all edges $e,finE$. We show that each $2$-cycle is a sum of two special types of skew-symmetric $2$-cycles: skew-symmetric cycle-pair $2$-cycles and skew-symmetric quad $2$-cycles. In case that the graph is Kuratowski connected, we show that each skew-symmetric $2$-cycle is a sum of skew-symmetric cycle-pair $2$-cycles. Similar results like this had previously been obtained by one of the authors for symmetric $2$-cycles. Symmetric $2$-cycles are $2$-cycles $d$ such that $d(e,f)=d(f,e)$ for all edges $e,finE$.

Recommendations

• scientific article; zbMATH DE number 475593
• On 2k-twisted graphs
• scientific article; zbMATH DE number 4010536
• scientific article; zbMATH DE number 26498
• Jordan circuits of a graph

Cites work

• A polynomial-time algorithm to find a linkless embedding of a graph
• Configuration spaces of algebraic varieties
• Configuration Spaces.
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Homology of Deleted Products of One-Dimensional Spaces
• Homotopy Groups of Certain Deleted Product Spaces
• scientific article; zbMATH DE number 54028 (Why is no real title available?)
• scientific article; zbMATH DE number 1744021 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Invitation to topological robotics
• Sachs' linkless embedding conjecture
• Safe Cooperative Robot Dynamics on Graphs
• The cohomology ring of the colored braid group
• The Fundamental Group of Certain Deleted Product Spaces
• Topology of configuration space of two particles on a graph. I.

Cited in

(9)

• Cycles of length 2 modulo 3 in graphs
• Cycles in 2-factors of balanced bipartite graphs
• On factor-invariant graphs with two cycles
• 2-Walk linear graphs with small number of cycles
• scientific article; zbMATH DE number 1289749 (Why is no real title available?)
• scientific article; zbMATH DE number 1404134 (Why is no real title available?)
• scientific article; zbMATH DE number 5174848 (Why is no real title available?)
• scientific article; zbMATH DE number 6471182 (Why is no real title available?)
• Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces

This page was built for publication: On 2-cycles of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170796)