Related papers: Almost resolvable even cycle systems of $(K_u \tim…

Burr and Erd\H{o}s conjectured that for each $k,\ell \in \mathbb Z^+$ such that $k \mathbb Z + \ell$ contains even integers, there exists $c_k(\ell)$ such that any graph of average degree at least $c_k(\ell)$ contains a cycle of length…

We Prove That The Uniform Upper Bound for the Number Of Limit Cycles Of The Lienard Equation of Degree 4 Can be equals to 2. Further We Suggest to Embedding Planar Lienard Equations In Higher Dimension and Present question of completly…

Consider a sufficiently smooth nearly integrable Hamiltonian system of two and a half degrees of freedom in action-angle coordinates \[ H_\epsilon (\varphi,I,t)=H_0(I)+\epsilon H_1(\varphi,I,t), \varphi\in T^2,\ I\in U\subset R^2,\ t\in…

In this paper, we first propose a new concept of almost periodic time scales, a new definition of almost automorphic functions on almost periodic time scales, and study some their basic properties. Then we prove a result ensuring the…

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…

It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $\Delta^{mon}(G)\leq n-3k+1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confirm this conjecture for $k=2$, prove several additional…

We consider quasinormal modes with complex energies from the point of view of the theory of quasi-exactly solvable (QES) models. We demonstrate that it is possible to find new potentials which admit exactly solvable or QES quasinormal modes…

In this paper we consider a family of active scalars with a velocity field given by $u = \Lambda^{-1+\alpha}\nabla^{\perp} \theta$, for $\alpha \in (0,1)$. This family of equations is a more singular version of the two-dimensional Surface…

The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in…

We determine the maximum number of copies of $K_{s,s}$ in a $C_{2s+2}$-free $n$-vertex graph for all integers $s \ge 2$ and sufficiently large $n$. Moreover, for $s\in\{2,3\}$ and any integer $n$ we obtain the maximum number of cycles of…

First examples of quasi-exactly solvable models describing spin-orbital interaction are constructed. In contrast with other examples of matrix quasi-exactly solvable models discussed in the literature up to now, our models admit (but still…

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

For a large class of expanding maps of the interval, we prove that partial sums of Lipschitz observables satisfy an almost sure central limit theorem (ASCLT). In fact, we provide a speed of convergence in the Kantorovich metric. Maxima of…

We study K-processes, which are Markov processes in a denumerable state space, all of whose elements are stable, with the exception of a single state, starting from which the process enters finite sets of stable states with uniform…

In this paper, we investigate the existence, uniqueness, and exponential decay of asymptotically almost periodic (AAP-) mild solutions for the parabolic-parabolic Keller-Segel systems on a bounded domain $\Omega \subset \mathbb{R}^n$ with a…

For any even integer $k\ge 6$, integer $d$ such that $k/2\le d\le k-1$, and sufficiently large $n\in (k/2)\mathbb N$, we find a tight minimum $d$-degree condition that guarantees the existence of a Hamilton $(k/2)$-cycle in every…

Let $\textbf{k} := (k_1,\ldots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\textbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

The stability of heteroclinic cycles may be obtained from the value of the local stability index along each connection of the cycle. We establish a way of calculating the local stability index for quasi-simple cycles: cycles whose…