Related papers: On the cyclicity of hyperbolic polycycles

During the last years the authors have studied the number of limit cycles of several families of planar vector fields. The common tool has been the use of an extended version of the celebrated Bendixson-Dulac Theorem. The aim of this work…

Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…

Let $X$ be a smooth projective variety of dimension $n\geq 3$, and let $L$ be an ample line bundle on $X$. In this article, we study the algebraic hyperbolicity of a very general section of the adjoint linear series $|K_X+mL|$ when the…

The coexistence of singularities and regular orbits in chain transitive sets has been a major obstacle in understanding the hyperbolic/partial hyperbolic nature of robust dynamics. Notably, the vector fields with all periodic orbits…

The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ${\ell}$ and…

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

Let $\mathcal{G}=\{G_1, G_2, \ldots , G_k\}$ be a family of bipartite graphs on the same vertex set. A rainbow Hamilton path (cycle) in $\mathcal{G}$ is a path (cycle) that visits each vertex precisely once such that any two edges belong to…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

We evidence a family $\mathcal{X}$ of square matrices over a field $\mathbb{K}$, whose elements will be called X-matrices. We show that this family is shape invariant under multiplication as well as transposition. We show that $\mathcal{X}$…

Given a geodesic line $\gamma$ the hyperbolic space $\mathbb H^n$ we formulate a necessary and sufficient condition for a function along this geodesic which measure the mean curvature of totally umbilical leaves of a foliation orthogonal to…

We consider Holder continuous linear cocycles over partially hyperbolic diffeomorphisms. For fiber bunched cocycles with one Lyapunov exponent we show continuity of measurable invariant conformal structures and sub-bundles. Further, we…

Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…

We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let $\Gamma$ be an $(n,d,\lambda)$-graph, i.e., $n$-vertex, $d$-regular graphs with all nontrivial eigenvalues in the…

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…

We introduce a type of minimal surface in the pseudo-hyperbolic space $\mathbb{H}^{n,n}$ (with $n$ even) or $\mathbb{H}^{n+1,n-1}$ (with $n$ odd) associated to cyclic $\mathrm{SO}_0(n,n+1)$-Higg bundles. By establishing the infinitesimal…

Given a hyperbolic group $G$ and a maximal infinite cyclic subgroup $\langle g \rangle$, we define a {\it drilling of $G$ along $g$}, which is a relatively hyperbolic group pair $(\widehat{G}, P)$. This is inspired by the well-studied…

The purpose of the present paper is to study the limit cycles of one-parameter perturbed plane Hamiltonian vector field $X_\varepsilon$ $$ X_\varepsilon : \left\{ \begin{array}{llr} \dot{x}=\;\; H_y+\varepsilon f(x,y)\\…

Given a family of graphs $G_1,\dots,G_{n}$ on the same vertex set $[n]$, a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_c$ contributes exactly one edge. We prove that if $G_1,\dots,G_{n}$ are independent samples of…