Related papers: Graph maps with zero topological entropy and seque…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…
Consider a symplectic surface $\Sigma$ with two properly embedded Hamiltonian isotopic curves $L$ and $L'$. Suppose $g \in Ham (\Sigma)$ is a Hamiltonian diffeomorphism which sends $L$ to $L'$. Which dynamical properties of $g$ can be…
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs…
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
We investigate the prevalence of Li-Yorke pairs for $C^2$ and $C^3$ multimodal maps $f$ with non-flat critical points. We show that every measurable scrambled set has zero Lebesgue measure and that all strongly wandering sets have zero…
This paper establishes topological (equi-)semiconjugacy and (equi-)conjugacy between induced non-autonomous set-valued systems and subshifts of finite type. First, some necessary and sufficient conditions are given for a non-autonomous…
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
Concepts from the Ergodic Theory are used to describe the existence of non-transitive maps in attractors of phase synchronous chaotic systems. It is shown that for a class of phase-coherent systems, e.g. the sinusoidally forced Chua's…
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement…
We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid $C^*$-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid $\mathcal{G}_E$, the properties of being…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
Given a (directed) graph G=(V,A), a subset X of V is an interval of G provided that for any a, b\in X and x\in V-X, (a,x)\in A if and only if (b,x)\in A and (x,a)\in A if and only if (x,b)\in A. For example, \emptyset, \{x\} (x \in V) and V…
A pure pair in a graph $G$ is a pair $(Z_1,Z_2)$ of disjoint sets of vertices such that either every vertex in $Z_1$ is adjacent to every vertex in $Z_2$, or there are no edges between $Z_1$ and $Z_2$. With Maria Chudnovsky, we recently…
In the family of area-contracting H\'enon-like maps with zero topological entropy we show that there are maps with infinitely many moduli of stability. Thus one cannot find all the possible topological types for non-chaotic area-contracting…
We prove that for every ergodic invariant measure with positive entropy of a continuous map on a compact metric space there is $\delta>0$ such that the dynamical $\delta$-balls have measure zero. We use this property to prove, for instance,…
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
We prove a few results about non-nilpotent graphs of symmetric groups $S_n$ -- namely that they have a Hamiltonian cycle and they satisfy a conjecture of Nongsiang and Saikia. The latter is likewise proven for alternating groups $A_n$. We…
In this paper, two sufficient and necessary conditions are given. The first one characterizes when the boundary path groupoid of a topological graph without singular vertices has closed interior of its isotropy group bundle, and the second…