Related papers: A note on Hilbert 16th Problem

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. Keywords: planar graph, choosability AMS Mathematics Subject Classification: 05C15

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…

Fractionally-quadratic transformations which reduce any two-dimensional quadratic system to the special Lienard equation are introduced. Existence criteria of cycles are obtained.

We analyze the asymptotic extremal growth rate of the Betti numbers of clique complexes of graphs on n vertices not containing a fixed forbidden induced subgraph H. In particular, we prove a theorem of the alternative: for any H the growth…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that for $k \gg0$ the postulation number of $I^k$ is bounded by a linear function of $k$, and it is a linear function…

In this paper, we consider a variant of Pillai's problem over function fields $ F $ in one variable over $ \mathbb{C} $. For given simple linear recurrence sequences $ G_n $ and $ H_m $, defined over $ F $ and satisfying some weak…

Given two graphs $H$ and $F$, the generalized planar Tur\'an number $\mathrm{ex}_\mathcal{P}(n,H,F)$ is the maximum number of copies of $H$ that an $n$-vertex $F$-free planar graph can have. We investigate this function when $H$ and $F$ are…

In this paper, we give a positive answer to the open question: Can there exist 4 limit cycles in quadratic near-integrable polynomial systems? It is shown that when a quadratic integrable system has two centers and is perturbed by quadratic…

By using the Picard-Fuchs equation and the property of Chebyshev space to the discontinuous differential system, we obtain an upper bound of the number of limit cycles for the nongeneric quadratic reversible system when it is perturbed…

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…

We study a class of planar continuous piecewise linear vector fields with three zones. Using the Poincar\'e map and some techniques for proving the existence of limit cycles for smooth differential systems, we prove that this class admits…

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

Let ${\rm ex}_{\mathcal{P}}(n,T,H)$ denote the maximum number of copies of $T$ in an $n$-vertex planar graph which does not contain $H$ as a subgraph. When $T=K_2$, ${\rm ex}_{\mathcal{P}}(n,T,H)$ is the well studied function, the planar…

The planar Tur\'an number of a graph $H$, denoted $ex_{_\mathcal{P}}(n,H)$, is the maximum number of edges in a planar graph on $n$ vertices without containing $H$ as a subgraph. This notion was introduced by Dowden in 2016 and has…

Let $ v$ be a smooth vector field on the plane, that is a map from the plane to the unit circle. We study sufficient conditions for the boundedness of the Hilbert transform \operatorname H_{v, \epsilon}f(x) := \text{p.v.}\int_{-\epsilon}^…

We show that every $n$-vertex $5$-connected planar triangulation has at most $9n-50$ many cycles of length $5$ for all $n\ge 20$ and this upper bound is tight. We also show that for every $k\geq 6$, there exists some constant $C(k)$ such…

In 1975, Erd\H{o}s asked the following natural question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd\H{o}s observed that the upper bound $O(n^{5/3})$ holds since…

In this paper, we study the bifurcation of limit cycles near a homoclinic cuspidal loop in a planar cubic near-Hamiltonian system by high-order Melnikov functions. We present a method combining the algebraic structure of Abelian integrals…