Related papers: Graph maps with zero topological entropy and seque…
In this paper, we construct a homeomorphism on the unit closed disk to show that an invertible mapping on a compact metric space is Li-Yorke chaotic does not imply its inverse being Li-Yorke chaotic.
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…
It is proved that positive entropy implies mean Li-Yorke chaos for a G-system, where G is a countable infinite discrete bi-orderable amenable group. Examples are given for the cases of integer lattice groups and groups of integer unipotent…
Given a graph G, of arbitrary size and unbounded vertex degree, denote by |G| the one-complex associated with $G$. The topological space |G| is n-arc connected (n-ac) if every set of no more than n points of |G| are contained in an arc (a…
This paper introduces a class of polynomial maps in Euclidean spaces, investigates the conditions under which there exist Smale horseshoes and uniformly hyperbolic invariant sets, studies the chaotic dynamical behavior and strange…
We show that every dendrite satisfying the condition that no subtree of it contains all free arcs admits a transitive, even exactly Devaney chaotic map with arbitrarily small entropy. This gives a partial answer to a question of Baldwin…
The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…
In this paper, for any given polynomial, by analyzing the limiting behavior of ergodic averages along polynomials of several variables and prime numbers, we prove that for a topology dynamical system, positive entropy implies mean Li-Yoke…
This paper is devoted to problems stated by Z. Zhou and F. Li in 2009. They concern relations between almost periodic, weakly almost periodic, and quasi-weakly almost periodic points of a continuous map f and its topological entropy. The…
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…
Let $G=(V,E)$ be a graph without isolated vertices. A set $S\subseteq V$ is a paired-domination set if every vertex in $V-S$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching. The paired-domination…
Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…
We prove that the flow generated by any interval map with zero topological entropy is minimally mean-attractable (MMA) and minimally mean-L-stable (MMLS). One of the consequences is that any oscillating sequence is linearly disjoint with…
A pure pair in a graph $G$ is a pair $A,B$ of disjoint subsets of $V(G)$ such that $A$ is complete or anticomplete to $B$. Jacob Fox showed that for all $\epsilon>0$, there is a comparability graph $G$ with $n$ vertices, where $n$ is large,…
Let $G$ be a Berge graph that has no odd prism and no antihole of length at least six as an induced subgraph. We show that every such graph $G$ with no balanced skew-partition is either complete or has an even pair.
For the family of Lozi maps $L_{a,b}$, we consider parameter pairs for which the f\mbox{}ixed point $X$ has no homoclinic points and the period-two orbit $\{P,P'\}$ is attracting. For such parameters, let $\ell$ be the set of accumulation…