Related papers: On the cyclicity of hyperbolic polycycles

This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$. E.g., a cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is easy to…

In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…

For $\Gamma$ a relatively hyperbolic group, we construct a model for the universal space among $\Gamma$-spaces with isotropy on the family VC of virtually cyclic subgroups of $\Gamma$. We provide a recipe for identifying the maximal…

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…

On a 4-dimensional compact symplectic manifold, we study how suitable perturbations of a toric system to a family of completely integrable systems with $\mathbb{S}^1$-symmetry lead to various hyperbolic-regular singularities. We compute and…

We study the convergence of graphs consisting of finitely many internal rays for degenerating Newton maps. We state a sufficient condition to guarantee the convergence. As an application, we investigate the boundedness of hyperbolic…

Given a metric (graph) bundle $X$ over $B$ where all the fibres are strongly relatively hyperbolic and nonelementary we show that, under certain conditions, $X$ is strongly hyperbolic relative to a collection of maximal cone-subbundles of…

Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…

It is shown that for non-hyperbolic real quadratic polynomials topological and quasisymmetric conjugacy classes are the same. By quasiconformal rigidity, each class has only one representative in the quadratic family, which proves that…

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…

We study the laminarity of the Green current of endomorphisms of $P^2C$ near hyperbolic measures of saddle type. When these measures are supported by attracting sets, we prove that the Green current is laminar in the basin of attraction and…

Let $G$ be a graph embedded in a fixed surface $\Sigma$ of genus $g$ and let $L=(L(v):v\in V(G))$ be a collection of lists such that either each list has size at least five, or each list has size at least four and $G$ is triangle-free, or…

We algebraically characterize free by cyclic groups that have coarse medians, and prove that this is equivalent to the a priori stronger properties of being colourable hierarchically hyperbolic groups and being quasi-isometric to CAT(0)…

We describe a new and robust method to prove rigidity results in complex dynamics. The new ingredient is the geometry of the critical puzzle pieces: under control of geometry and ``complex bounds'', two generalized polynomial-like maps…

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

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…

Let $c(G)$ denote the circumference of a graph $G$, i.e., the number of vertices in its longest cycle. For positive integers $n$ and $k$ with $n>k$, let $\varGamma(n;k)$ be the class of graphs of order $n$ with $c(G) = n-k$ such that every…

We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur\'an- and Dirac-type results. While the Tur\'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph…

We characterize model polynomials that are cyclic in Dirichlet-type spaces in the unit ball of $\mathbb{C}^n$, and we give a sufficient capacity condition in order to identify non-cyclic vectors.

Looking to the fundamental domains of space groups we can investigate in which space they can be realized. If this space is hyperbolic, then the corresponding space group is also hyperbolic. In addition to the usual methods for…