Related papers: On Periodic Solutions Of Lienard Equations
We consider families of planar polynomial vector fields of degree $n$ and study the cyclicity of a type of unbounded polycycle~$\Gamma$ called hemicycle. Compactified to the Poincar\'e disc,~$\Gamma$ consists of an affine straight line…
We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…
We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…
We study the number and distribution of the limit cycles of a planar vector field whose component functions are random polynomials. We prove a lower bound on the average number of limit cycles when the random polynomials are sampled from…
Let W be a weight-homogeneous planar polynomial differential system with a center. We find an upper bound of the number of limit cycles which bifurcate from the period annulus of W under a generic polynomial perturbation. We apply this…
The already proved Lum-Chua's conjecture says that a continuous planar piecewise linear differential system with two zones separated by a straight line has at most one limit cycle. In this paper, we provide a new proof by using a novel…
Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\Delta\ge 32$. We prove that $\chi_{\ell}(G^2)\le \Delta+3$. For arbitrarily large maximum degree $\Delta$, there exist planar graphs $G_{\Delta}$ of girth 6…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…
In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…
For a polynomial differential system $$\dot{x}=-y+\sum\limits_{i+j=3}\alpha_{i,j}x^iy^j,\quad \dot{y}=x+\sum\limits_{i+j=3}\beta_{i,j}x^iy^j,$$ Pleshkan (Differ. Equations, 1969) proved that the origin is an isochronous center of this…
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…
In this paper, we construct a periodic dichotomy transformation using solutions of periodic Riccati and Lyapunov equations. As an application of this transformation, we provide an explicit representation of the optimal extremal for periodic…
For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…
Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…
How many copies of a fixed odd cycle, $C_{2m+1}$, can a planar graph contain? We answer this question asymptotically for $m\in\{2,3,4\}$ and prove a bound which is tight up to a factor of $3/2$ for all other values of $m$. This extends the…
We study the existence of non-collision periodic solutions with Newtonian potentials for the following planar restricted 4-body problems: Assume that the given positive masses $m_{1},m_{2},m_{3}$ in a Lagrange configuration move in circular…
While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period.…
For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the…