Related papers: Correction to ``Knotted Hamiltonian cycles in spat…
We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on…
An error in the paper [J. Math. Phys. 43, 6343 (2002); math-ph/0207009] is corrected. Further explanation is given.
We present a proof of the formula (given in Lurie's Higher Algebra) for the operad governing diagrams of operad algebras. We believe that our proof corrects a flaw in the original argument. 2nd version: a corrected proof given.
Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…
We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…
This article presents a survey of some recent results in the theory of spatial graphs. In particular, we highlight results related to intrinsic knotting and linking and results about symmetries of spatial graphs. In both cases we consider…
This is a new version of our previous work. In this version, we fill a gap included in the original proof of Theorem 1.1 in our previous paper entitled "An iterative method for Kirchhoff type equations and its applications".
A new complete invariant for acyclic graphs is presented
We study 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. It follows from the theorems of Dirac and of Koml\'os, Sark\"ozy, and Szemer\'edi…
We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the $(2n+1)$-dimensional hypercube induced by all vertices with exactly $n$ or $n+1$ many 1s.
We correct the statements of two theorems and two corollaries in our paper [On subgroup perfect codes in Cayley graphs, European J. Combin. 91 (2021) 103228]. Proofs of these theorems and three other results are given as well.
An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m \times n$…
We show that $p=\sqrt{\frac{e}{n}}$ is a sharp threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle. This improves the previous results of K\"uhn and Osthus and also Nenadov and \v{S}kori\'c.
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
A step forward is made in a long standing Lov\'{a}sz's problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes, other than the Petersen graph,…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to…
We give a proof of the fact tha the subset of the rational curves form a closed analytic subset in the space of the 1-dimensional cycles of a complex space.
We embed the space of totally real $r$-cycles of a totally real projective variety into the space of complex $r$-cycles by complexification. We provide a proof of the holomorphic taffy argument in the proof of Lawson suspension theorem by…