Related papers: On ubiquity problems in infinite digraphs
We consider the Gelfand problem with rapidly growing nonlinearities in the two-dimensional bounded strictly convex domains. In this paper, we prove the uniformly boundedness of finite Morse index solutions. As a result, we show that there…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…
We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.
We show that every orientable infinite-type surface is properly rigid as a consequence of a more general result. Namely, we prove that if a homotopy equivalence between any two non-compact orientable surfaces is a proper map, then it is…
Consider a connected homogeneous Riemannian manifold $(M,ds^2)$ and a Riemannian covering $(M,ds^2) \to \Gamma \backslash (M,ds^2)$. If $\Gamma \backslash (M,ds^2)$ is homogeneous then every $\gamma \in \Gamma$ is an isometry of constant…
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
This paper focuses on local curvature invariants associated with bi-Lagrangian structures. We establish several geometric conditions that determine when the canonical connection is flat, building on our previous findings regarding…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as ucycles or generalized deBruijn cycles or…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
We say a directed graph $G$ on $n$ vertices is irredundant if the removal of any edge reduces the number of ordered pairs of distinct vertices $(u,v)$ such that there exists a directed path from $u$ to $v$. We determine the maximum possible…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted…
In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…
Fix an oriented graph H, and let G be a graph with bounded clique number and very large chromatic number. If we somehow orient its edges, must there be an induced subdigraph isomorphic to H? Kierstead and Rodl raised this question for two…
The main aim of this paper is to study existence and stability properties of rotationally symmetric proper biharmonic maps between two $m$-dimensional models (in the sense of Greene and Wu). We obtain a complete classification of…
We prove that two finite-dimensional commutative algebras over an algebraically closed field are isomorphic if and only if they give rise to isomorphic representations of the category of finite sets and surjective maps.
Motivated by the Cauchy-Davenport theorem for sumsets, and its interpretation in terms of Cayley graphs, we prove the following main result : There is a universal constant e > 0 such that, if G is a connected, regular graph on n vertices,…