Related papers: The structures of pointwise recurrent quasi-graph …
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…
We show that, given any finite dimensional, connected, compact metric space Z, there exists a group G acting geometrically on two CAT(0) spaces X and Y, a G-equivariant quasi-isometry f from X to Y, and a geodesic ray c in X, such that the…
We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.
We find conditions for two piecewise C^{2+\nu} homeomorphisms f and g of the circle to be C^1 conjugate. Besides the restrictions on the combinatorics of the maps (we assume that the maps have bounded combinatorics), and necessary…
In this paper, we consider a class of continuous maps characterized by a singularity of order $x^{q/p}$ (with $p,q \in \mathbb{N}$, $p>q$, and $(p,q)=1$) on one side of the discontinuity boundary $\Sigma$ and a linear behaviour on the other…
We prove that for a homeomorphism f that is isotopic to the identity on a closed hyperbolic surface, the following are equivalent: * f acts hyperbolically on the fine curve graph; * f is isotopic to a pseudo-Anosov map relative to a finite…
Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
Let X and Y be compact, simply connected and locally connected subsets of R^2, and let f : X -> Y be a homeomorphism isotopic to the identity on X. Generalizing Brouwer's plane translation theorem for self-maps of the plane, we prove that f…
Let G be a graph drawn in the plane so that its edges are represented by x-monotone curves, any pair of which cross an even number of times. We show that G can be redrawn in such a way that the x-coordinates of the vertices remain unchanged…
We study renormalizations of piecewise smooth homeomorphisms on the circle, by considering such maps as generalized interval exchange maps of genus one. Suppose that $Df$ is absolutely continuous on each interval of continuity and…
Let $X$ be a regular curve and let $f: X\to X$ be a monotone map. In this paper, nonwandering set of $f$ and the structure of special $\alpha$-limit sets for $f$ are investigated. We show that AP$(f)= \textrm{R}(f) =\Omega(f)$, where…
In this paper, we introduce the notion of negatively regionally proximal pairs of onto maps which coincides with the set of regionally proximal pair of $f^{-1}$, whenever $f$ is an homeomorphism and we prove the maximal equicontinoues…
A graph $G$ is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. It is well known that a 2-connected, $k$-regular graph $G$ on at most $3k-1$ vertices is edge-Hamiltonian if for every edge…
Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…