Related papers: On the tangle compactification of infinite graphs
The article is devoted to microbundles over topological rings. Their structure, homomorphisms, automorphisms and extensions are studied. Moreover, compactifications and inverse spectra of microbundles over topological rings are…
Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…
We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence…
We present some recent results in Fibrewise General Topology with special regard to the theory of Tychonoff compactifications of mappings. Several open problems are also proposed.
In this paper we investigate multifractal decompositions based on values of Birkhoff averages of functions from a class of symbolically continuous functions. This will be done for an expanding interval map with infinitely many branches and…
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
A problem by Diestel is to extend algebraic flow theory of finite graphs to infinite graphs with ends. In order to pursue this problem, we define an A-flow and non-elusive H-flow for arbitrary graphs and for abelian topological Hausdorff…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
PhD Thesis--A compilation of the papers: "Lower Bounds for Identifying Codes in Some Infinite Grids", "Improved Bounds for r-identifying Codes of the Hex Grid", and "Vertex Identifying Codes for the n-dimensional Lattics" along with some…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
The goal of the paper is to apply the general operator theoretic construction known as the Schur complement for computation of the spectrum of certain infinite graphs which can be viewed as finite graphs with the ray attached to them. The…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
We introduce and study certain topological spaces associated with connected rooted graphs. These spaces reflect combinatorial and order theoretic properties of the underlying graph and relate in the case of hyperbolic graphs to Gromov's…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.
We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…