Cycles in graphs and in hypergraphs: results and problems
E. Alkin, S. Dzhenzher, O. Nikitenko, A. Skopenkov, A. Voropaev
TL;DR
This expository work surveys 1-cycles in graphs and 2-cycles in hypergraphs, with a focus on decomposition, bases, and representations in square-like constructions. It develops a Künneth-type framework showing that 2-cycles in the square $K^2$ are generated by products of 1-cycles from $K$, and extends these ideas to hypergraphs via tetrahedra as 2-cycles and to geometric interpretations using Cartesian products. The text provides explicit enumerations, constructs bases for cycle spaces, and discusses symmetric/coboundary phenomena, along with numerous open problems. Together, these results connect combinatorial cycle theory with topological and geometric viewpoints, enriching the understanding of cycle spaces in graphs and higher-dimensional analogues.
Abstract
This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$. E.g., a cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is easy to check that the sum (modulo $2$) of $1$-cycles is a $1$-cycle. In this text we study the following problems: to find $\bullet$ the number of all 1-cycles in a given graph; $\bullet$ a small number of 1-cycles in a given graph such that any 1-cycle is the sum of some of them. We also consider generalizations (of these problems) to graphs with symmetry, and to $2$-cycles in $2$-dimensional hypergraphs.
