Related papers: Limit cycles of linear vector fields on $(\mathbb{…

The goal of this paper is to study the number of sliding limit cycles of a regularized piecewise linear $VI_3$ two-fold using the notion of slow divergence integral. We focus on limit cycles produced by canard cycles located in the…

A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $n\ge 4$, we describe arbitrarily long mutation cycles involving…

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for…

We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…

This study investigates the existence and stability of limit cycles resulting from self-excited oscillations in linear multi-degree-of-freedom systems subjected to discontinuous, state-dependent forcing. Using the method of averaging and…

By introducing a max-plus dynamical system having limit cycles, we discuss their periodicity, especially the number of discrete states in them. We also find that quasi-periodic cycles exist depending on the bifurcation parameter in the…

Building on the limit theory for set functions, we prove that the limit of convergent sequence of bounded-degree graphs' cycle matroids can be represented as the cycle matroid of a graphing, analogous to the completeness result for…

We study fluctuations of the Wigner time delay for open (scattering) systems which exhibit mixed dynamics in the classical limit. It is shown that in the semiclassical limit the time delay fluctuations have a distribution that differs…

The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.

Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…

Limit cycles of planar polynomial vector fields have been an active area of research for decades; the interest in periodic-orbit related dynamics comes from Hilbert's 16th problem and the fact that oscillatory states are often found in…

A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…

We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\dots, C(n)$ for…

In this paper we deal with the existence of periodic orbits of geodesible vector fields on closed 3-manifolds. A vector field is geodesible if there exists a Riemannian metric on the ambient manifold making its orbits geodesics. In…

Consider the vector field $x'= -yG(x, y), y'=xG(x, y),$ where the set of critical points $\{G(x, y) = 0\}$ is formed by $K$ straight lines, not passing through the origin and parallel to one or two orthogonal directions. We perturb it with…

Let $G$ be a $k$-connected graph with $k\geq 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {specified} vertices with length at least the average degree…

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\alpha(H)$ denotes the size of a largest…

We study a system of coupled phase oscillators near a saddle-node on an invariant circle bifurcation and driven by random intrinsic frequencies. Under the variation of control parameters, the system undergoes a phase transition changing the…