Related papers: Correction to ``Knotted Hamiltonian cycles in spat…

In this paper, based on the embedded homology groups of hypergraphs defined in \cite{h1}, we define the product of hypergraphs and prove the corresponding K\"{u}nneth formula of hypergraphs which can be generalized to the K\"{u}nneth…

We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characterize the graphs for which the two coincide. We construct a…

In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature…

The aim of this paper is to study the skein exact sequence for knot Floer homology. We prove precise graded version of this sequence, and also one using $\HFm$. Moreover, a complete argument is also given purely within the realm of grid…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.

We consider the space of all representations of the commutator subgroup of a knot group into Z/p, p is prime. As proven by D. Silver and S. Williams, this space can be completely described by a finite oriented graph. We describe the lengths…

We prove that the number of single element extensions of $M(K_{n+1})$ is $2^{{n\choose n/2}(1+o(1))}$. This is done using a characterization of extensions as "linear subclasses".

We investigate the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. For all integers $k\geq1$, $r\geq 0$, and $\ell\geq (r+1)r$, and for any…

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…

We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Under certain integrability and geometric conditions, we prove division theorems for the exact sequences of holomorphic vector bundles and improve the results in the case of Koszul complex. By introducing a singular Hermitian structure on…

Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic…

This note refers to our previous paper "The emergence of torsion in the continuum limit of distributed edge-dislocations". It identifies and fixes an error in the notion of convergence of Weitzenb\"ock manifolds defined in the paper, and in…

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

In this article we discuss the question of presence of Hamiltonian cycle in the un-directed power graph of a group. In the process we develop weighted Hamiltonian cycle concept and prove a few general results regarding the Hamiltonian…

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.