相关论文: The Hamilton-Waterloo problem for Hamilton cycles …

It is proved that, if $k\ge2$ is a fixed integer and $1 \ll H \le X/2$, then $$ \int_{X-H}^{X+H}\Delta^4_k(x)\d x \ll_\epsilon X^\epsilon\Bigl(HX^{(2k-2)/k} + H^{(2k-3)/(2k+1)}X^{(8k-8)/(2k+1)}\Bigr), $$ where $\Delta_k(x)$ is the error…

The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem.…

The Riccati equation method is used to establish new oscillation criteria for linear matrix Hamiltonian systems. New approaches allow to extend and completed a result, obtained by S. Kumary and S. Umamaheswaram. The oscillation problem for…

After long-term efforts, the Hamilton path (cycle) problem for connected vertex-transitive graphs of order $pq$ (where $p$ and $q$ are primes) was finally resolved in 2021, see [10]. Fifteen years ago, mathematicians began addressing this…

In the random hypergraph H=H(n,p;3) each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {x_i,y_i,x_{i+1}\} for i=1,2,...,n/2. We prove that there exists an absolute…

An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult…

In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their…

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K\"uhn and Osthus for the 3-uniform case. Though some…

In this paper, we develop a Hamilton-Jacobi theory for forced Hamiltonian and Lagrangian systems. We study the complete solutions, particularize for Rayleigh systems and present some examples. Additionally, we present a method for the…

In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\log…

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…

The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195-200) proved that the Hamiltonian Cycle Problem is NP-Complete even for…

This paper will develop a Li-Yau-Hamilton type differential Harnack estimate for positive solutions to the Newell-Whitehead equation on $\mathbb{R}^n$. We then use our LYH-differential Harnack inequality to prove several properties about…

In this paper we consider the existence of Hamilton cycles and perfect matchings in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are…

In this note we prove: {\it Let $D$ be a 2-strong digraph of order $n$ such that its $n-1$ vertices have degrees at least $n+k$ and the remaining vertex $z$ has degree at least $n-k-4$, where $k$ is a positive integer. If $D$ contains a…

We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time…

The tree formula, which relates proper and connected vertices, is shown to be the solution to a Hamilton-Jacobi equation.