Related papers: A note on Hilbert 16th Problem

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…

In this note we give a family of planar polynomial differential systems with a prescribed hyperbolic limit cycle. This family constitutes a corrected and wider version of an example given in the work of M.A. Abdelkader entitled ``Relaxation…

We prove that to each real singularity $f: (\mathbb{R}^{n}, 0) \to (\mathbb{R}^k, 0)$ with $k\geq 2$ one can associate systems of differential equations $\mathfrak{g}^{k}_f$ which are pushforwards in the category of $\mathcal{D}$-modules…

We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the $(2n+1)$-dimensional hypercube induced by all vertices with exactly $n$ or $n+1$ many 1s.

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…

We construct a polynomial planar vector field of degree two with one invariant algebraic curves of large degree. We exhibit an explicit quadratic vector fields which invariant curves of degree nine, twelve, fifteen and eighteen degree.

We study, theoretically and experimentally, a 1-parameter family of transformations and their limiting vector field on the space of plane polygons. These transformations are discrete analogs of completely integrable transformation on closed…

The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…

In the present study we consider planar piecewise linear vector fields with two zones separated by the straight line $x=0$. Our goal is to study the existence of simultaneous crossing and sliding limit cycles for such a class of vector…

We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there…

The planar Tur\'an number of a graph $H$, denoted by $ex_{_\mathcal{P}}(n,H)$, is the largest number of edges in a planar graph on $n $ vertices without containing $H$ as a subgraph. In this paper, we continue to study the topic of…

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

We show that if a H\"{o}lder continuous linear cocycle over a hyperbolic system is measurably conjugate to a cocycle taking values in a unipotent group, then the cocycle is H\"older continuously conjugate to a cocycle taking values in a…

Dirac's theorem (1952) is a classical result of graph theory, stating that an $n$-vertex graph ($n \geq 3$) is Hamiltonian if every vertex has degree at least $n/2$. Both the value $n/2$ and the requirement for every vertex to have high…

For a set of matroids $\mathcal{M}$, let $ex_\mathcal{M}(n)$ be the maximum size of a simple rank-$n$ matroid in $\mathcal{M}$. We prove that, for any finite field $\mathbb{F}$, if $\mathcal{M}$ is a minor-closed class of…

We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eight colors. Our main contribution is significant…

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…

A planar graph is essentially $4$-connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected planar graph $G$ on $n$ vertices contains a…

In this paper, we study the problem of limit cycle bifurcation in two piecewise polynomial systems of Li\'enard type with multiple parameters. Based on the developed Melnikov function theory, we obtain the maximum number of limit cycles of…

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…