Related papers: The Demyanov-Ryabova conjecture is false
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive graphs…
In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every \alpha > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + \alpha)n contains at least n/8…
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…
We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…
Although the limit cycle have been studied for more than 100 years, the existence of its Lyapunov function is still poorly understood. By considering a common limit cycle system, a puzzle related to the existence of Lyapunov functions for…
A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…
In 2022, Gao, Huo, Liu, and Ma proved that every graph with minimum degree at least $k+1$ contains $k$ admissible cycles, where a set of $k$ cycles is said to be admissible if their lengths form an arithmetic progression with common…
In 1962 P\'osa conjectured that every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of P\'osa's Conjecture. They also proved that it…
We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings…
Let $\pi: X \to Y$ be a morphism of projective varieties and suppose that $\alpha$ is a pseudo-effective numerical cycle class satisfying $\pi_*\alpha = 0$. A conjecture of Debarre, Jiang, and Voisin predicts that $\alpha$ is a limit of…
The Erd\H{o}s-Gy\'{a}rf\'{a}s conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the…
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…
In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…
We demonstrate how recent work of Favre and Gauthier, together with a modification of a result of the author, shows that a family of polynomials with infinitely many post-critically finite specializations cannot have any periodic cycles…
We study the maximum number of limit cycles that can bifurcate from a degenerate center of a cubic homogeneous polynomial differential system. Using the averaging method of second order and perturbing inside the class of all cubic…
A generalization of the famous Caccetta--H\"aggkvist conjecture, suggested by Aharoni [Rainbow triangles and the Caccetta-H\"aggkvist conjecture, J. Graph Theory (2019)], is that any family $\mathcal{F}=(F_1, \ldots,F_n)$ of sets of edges…
Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l at least four and at most n/2. We prove this conjecture for…
We study a conjecture, due to Voisin, on 0-cycles on varieties with $p_g=1$. Using Kimura's finite dimensional motives and recent results of Vial's on the refined (Chow-)K\"unneth decomposition, we provide a general criterion for Calabi-Yau…