Related papers: An update on the middle levels problem

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…

We prove that Hamiltonian Path and Hamiltonian Cycle are NP-hard on graphs of linear mim-width 26, even when a linear order of the input graph with mim-width 26 is provided together with input. This fills a gap left by a broken proof of the…

For any even integer $k\ge 6$, integer $d$ such that $k/2\le d\le k-1$, and sufficiently large $n\in (k/2)\mathbb N$, we find a tight minimum $d$-degree condition that guarantees the existence of a Hamilton $(k/2)$-cycle in every…

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…

A modification of Merino-Mi\v{c}ka-M\"utze's solution to a combinatorial generation problem of Knuth is proposed in this survey. The resulting alternate form to such solution is compatible with a reinterpretation by the author of a proof of…

In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K=K(n) edges, chosen uniformly at random from the…

We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there…

A multi-chain mean-field theory is developed and applied to a two-dimensional system of weakly coupled S=1/2 Heisenberg chains. The environment of a chain C_0 is modeled by a number of neighbor chains C_d, d = +/-1,...,+/-n, with the edge…

Let $\mathcal{G}=\{G_1,\ldots,G_n \}$ be a family of graphs of order $n$ with the same vertex set. A rainbow Hamiltonian cycle in $\mathcal{G}$ is a cycle that visits each vertex precisely once such that any two edges belong to different…

We study the existence of a directed Hamilton cycle in random digraphs with $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $D_{n,m}^{(\delta\geq1)}$. We prove that if $m=\tfrac n2(\log…

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

A hamiltonian cycle system (HCS, for short) of a graph $\Gamma$ is a partition of the edges of $\Gamma$ into hamiltonian cycles. A HCS is cyclic when it is invariant under a cyclic permutation of all the vertices of $\Gamma$; the existence…

Every semicomplete multipartite digraph contains a quasi-Hamiltonian path, but the problem of finding a quasi-Hamiltonian path with prescribed start and end vertex is NP-complete even when restricted to semicomplete multipartite digraphs…

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…

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…

In this paper, we consider a random geometric graph (RGG)~\(G\) on~\(n\) nodes with adjacency distance~\(r_n\) just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by…

This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…

In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two…

We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of…

It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.