The Structure of the 2-factor Transfer Digraph common for Thin Cylinder, Torus and Klein Bottle Grid Graphs

We prove that the transfer digraph ${\cal D}^*_{C,m}$ needed for the enumeration of 2-factors in the thin cylinder $TnC_{m}(n)$, torus $TG_{m}(n)$ and Klein bottle $KB_m(n)$ (all grid graphs of the fixed width $m$ and with $m \cdot n$ vertices), when $m$ is odd, has only two components of order $2^{m-1}$ which are isomorphic. When $m$ is even, ${\cal D}^*_{C,m}$ has $\left\lfloor \frac{m}{2} \right\rfloor + 1$ components which orders can be expressed via binomial coefficients and all but one of the components are bipartite digraphs. The proof is based on the application of recently obtained results concerning the related transfer digraph for linear grid graphs (rectangular, thick cylinder and Moebius strip).Comment: 11 pages, 5 figures. arXiv admin note: text overlap with arXiv:2212.0031

Graph Theory

Highlights of this workshop on structural graph theory included new developments on graph and matroid minors, continuous structures arising as limits of finite graphs, and new approaches to higher graph connectivity via tree structures