Related papers: Contractible Hamiltonian Cycles in Polyhedral Maps

A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops,…

The Hamiltonian number of a connected graph is the minimum of the lengths of the closed, spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a planar graph, formulated…

We study a certain polytope depending on a graph $G$ and a parameter $\beta\in(0,1)$ which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Eshragh \emph{et al.} conjectured a lower bound on the…

Let $\epsilon>0$. We consider the problem of constructing a Hamiltonian graph with $(1+\epsilon)n$ edges in the following controlled random graph process. Starting with the empty graph on $[n]$, at each round a set of $K=K(n)$ edges is…

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds…

We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regular oriented graph on $n > n_0$ vertices and degree at least $(1/4 + \varepsilon)n$ has a Hamilton cycle. This establishes an approximate…

An {\em $\ell$-offset Hamilton cycle} $C$ in a $k$-uniform hypergraph $H$ on~$n$ vertices is a collection of edges of $H$ such that for some cyclic order of $[n]$ every pair of consecutive edges $E_{i-1},E_i$ in $C$ (in the natural ordering…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.

In a previous paper we introduced examples of Hamiltonian mappings with phase space structures resembling circle packings. It was shown that a vast number of periodic orbits can be found using special properties. We now use this information…

The paper concludes the cycle of investigations on the bifurcation diagrams of the system with three degrees of freedom which describes the motion of an axially symmetric top with the Kowalevski conditions in a double force field. The…

We provide a model for an open invariant neighborhood of any orbit in a symplectic manifold endowed with a canonical proper symmetry. Our results generalize the constructions of Marle and Guillemin and Sternberg for canonical symmetries…

We explore to what extent the properties of a Gauss diagram are affected by the choice of its Hamiltonian cycle. We present an example of a realizable Gauss diagram and an unrealizable Gauss diagram that differ only by a choice of the…

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…

It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizations of these classical results. For a collection…

The well-known twenty types of 2-uniform tilings of the plane give rise infinitely many doubly semi-equivelar maps on the torus. In this article, we show that every such doubly semi-equivelar map on the torus contains a Hamiltonian cycle.…

On a closed symplectic surface Sigma of genus two or more, we give a new construction of an extended flux map (a crossed homomorphism from the symplectomorphism group Symp(Sigma) to the cohomology group H^1(Sigma;R) that extends the flux…

Experiments observing the liquid surface in a vertically oscillating container have indicated that modeling the dynamics of such systems require maps that admit states at infinity. In this paper we investigate the bifurcations in such a…

Finding necessary conditions for the geometry of flexible polyhedra is a classical problem that has received attention also in recent times. For flexible polyhedra with triangular faces, we showed in a previous work the existence of cycles…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…