Related papers: A variational approach to Hilbert's 16th problem w…
This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a switching curve $y=x^{m}$, where $m>1$ is an arbitrary positive. By analysing the first order Melnikov function, we give an…
In this paper, we study crossing limit cycles of planar discontinuous piecewise differential systems separated by a nonregular switching line, where one subsystem is a linear differential center and the other belongs to one of six families…
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…
This paper deals with the problem of limit cycle bifurcations for a piecewise near-Hamilton system with four regions separated by algebraic curves $y=\pm x^2$. By analyzing the obtained first order Melnikov function, we give an upper bound…
We illustrate with several new applications the power and elegance of the Bendixson Dulac theorem to obtain upper bounds of the number of limit cycles for several families of planar vector fields. In some cases we propose to use a function…
For a planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal P}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In this paper, we prove that $\operatorname{\mathbf{N}}_{\mathcal P}(n,P_7)\sim{4\over…
One of the main open problems in the qualitative theory of real planar differential systems is the study of limit cycles. In this article, we present an algorithmic approach for detecting how many limit cycles can bifurcate from the…
In this paper, using our bifurcational geometric approach, we solve the problem on the maximum number and distribution of limit cycles in the Kukles system representing a planar polynomial dynamical system with arbitrary linear and cubic…
We analyze the complex dynamics dynamics of a family of $\mathbb{Z}_{12}-$equivariant planar systems, by using their reduction to an Abel equation. We derive conditions in the parameter space that allow uniqueness and hyperbolicity of a…
This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a cubic curve. By analyzing the obtained first order Melnikov function, we give an upper bound of the number of limit cycles…
We apply the averaging theory of high order for computing the limit cycles of discontinuous piecewise quadratic and cubic polynomial perturbations of a linear center. These discontinuous piecewise differential systems are formed by two…
The main objective of this paper is to study the number of limit cycles in a family of polynomial systems. Using bifurcation methods, we obtain the maximal number of limit cycles in global bifurcation.
It this paper we study a class of perturbed Hamiltonian systems under perturbations of thirteen order in order to detect the number of limit cycles which bifurcate from some periodic orbits of the unperturbed Hamiltonian system. The system…
We extend the Eruguin result exposed in the paper "Construction of the whole set of ordinary differential equations with a given integral curve" published in 1952 and construct a differential system in $\Bbb{R}^N$ which admits a given set…
In this paper we study the family of planar hybrid differential systems formed by two linear centers and a polynomial reset map of any degree. We study their limit cycles and also provide examples of these hybrid systems exhibiting chaotic…
In this paper, we extend the slow divergence-integral from slow-fast systems, due to De Maesschalck, Dumortier and Roussarie, to smooth systems that limit onto piecewise smooth ones as $\epsilon\rightarrow 0$. In slow-fast systems, the slow…
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$…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…
Fractionally-quadratic transformations which reduce any two-dimensional quadratic system to the special Lienard equation are introduced. Existence criteria of cycles are obtained.
We study the topic of "extremal" planar graphs, defining $\mathrm{ex_{_{\mathcal{P}}}}(n,H)$ to be the maximum number of edges possible in a planar graph on $n$ vertices that does not contain a given graph $H$ as a subgraph. In…