Related papers: The Hamilton-Waterloo problem for Hamilton cycles …

We say that a Hamilton cycle $C=(x_1,\ldots,x_n)$ in a graph $G$ is $k$-symmetric, if the mapping $x_i\mapsto x_{i+n/k}$ for all $i=1,\ldots,n$, where indices are considered modulo $n$, is an automorphism of $G$. In other words, if we lay…

Cima, Ma\~{n}osas and Villadelprat (J. Differ. Equations, 157, 373--413, 1999) proved that a cubic Hamiltonian system possesses an isochronous center at the origin if and only if its Hamiltonian function can be expressed as…

In this paper, we mainly consider the existence of infinitely many homoclinic solutions for a class of subquadratic second-order Hamiltonian systems $\ddot{u}-L(t)u+W_u(t,u)=0$, where $L(t)$ is not necessarily positive definite and the…

We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations…

We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on…

${ 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…

We show that for integers $k\geq 4$ and $s\geq k^2+(3k-1)/4$, we have an asymptotic formula for the number of solutions, in positive integers $x_i$, to the inequality $\left|(x_1-\theta_1)^k+\dotsc+(x_s-\theta_s)^k-\tau\right|<\eta$, where…

We prove that a Hamilton-Jacobi equation in 1D with periodic forcing has a set of generalized solutions such that each solution is a sum of linear and continuous periodic functions; we also give a condition of uniqueness of this solution in…

The Hamiltonian formulation for perfect fluid equations with the l-conformal Galilei symmetry is proposed. For an arbitrary half-integer value of the parameter l, the Hamilton and non-canonical Poisson brackets are found, in terms of which…

We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT algorithm for the problem, matching the $O^*(2^{|K|})$…

For a Hamilton cycle in a rectangular $m \times n$ grid, what is the greatest number of turns that can occur? We give the exact answer in several cases and an answer up to an additive error of $2$ in all other cases. In particular, we give…

Some years ago I demonstrated a simulated annealing heuristic for the Hamiltonian cycle problem (Science 273, 413 (1996)). Here I propose an improved version of this heuristic.

Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \geq 3$) is Hamiltonian if every vertex has degree at least $n/2$. Both the value $n/2$ and the requirement for every vertex to have high…

We present an algorithm CRE, which either finds a Hamilton cycle in a graph $G$ or determines that there is no such cycle in the graph. The algorithm's expected running time over input distribution $G\sim G(n,p)$ is $(1+o(1))n/p$, the…

We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly…

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…

The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…

We study the asymptotic behavior of solutions to the Dirichlet problem for Hamilton-Jacobi equations with large drift terms, where the drift terms are given by the Hamiltonian vector fields of Hamiltonian $H$. This is an attempt to…

In this paper we study the existence and multiplicity of homoclinic solutions for the second order Hamiltonian system $\ddot{u}-L(t)u(t)+W_u(t,u)=0$, $\forall t\in\mathbb{R}$, by means of the minmax arguments in the critical point theory,…

Let $G_{k,n}$ be the $n$-balanced $k$-partite graph, whose vertex set can be partitioned into $k$ parts, each has $n$ vertices. In this paper, we prove that if $k \geq 2,n \geq 1$, for the edge set $E(G)$ of $G_{k,n}$ $$|E(G)|…