Related papers: Generalized 3x + 1 Mappings : counting cycles
In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of…
In this paper, we introduce a new category of mappings within metric spaces, specifically focusing on three-point analogs of the well-established Chatterjea type mappings. We demonstrate that Chatterjea type mappings and their three-point…
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 prove that every heteroclinic saddle loop (a two-saddle cycle) occurring in an analytic finite-parameter family of plane analytic vector fields, may generate no more than a finite number of limit cycles within the family.
This note contains a new proof of a theorem of Gang Xiao saying that the bicanonical map of a surface S of general type is generically finite if and only if the second plurigenus of S is strictly larger than 2. Such properties are also…
Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove…
We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
Building on the limit theory for set functions, we prove that the limit of convergent sequence of bounded-degree graphs' cycle matroids can be represented as the cycle matroid of a graphing, analogous to the completeness result for…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
Deciding if a graph is a Hamilton graph, also named the Hamilton cycle problem, is important for discrete mathematics and computer science. Due to no characterization to identify Hamilton graphs effectively, there are no tractable…
We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.
Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We characterize permanence of planar S-systems. Further, we construct a planar S-system with three limit cycles.
There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.
A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially…