Related papers: Edge-ends versus topological ends of graphs
Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…
The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…
We recently established a Toponogov type triangle comparison theorem for a certain class of Finsler manifolds whose radial flag curvatures are bounded below by that of a von Mangoldt surface of revolution (arXiv:1205.3913). In this article,…
A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
The bounds on the statuses of the nodes in a finite graph established by Entringer, Jackson, and Snyder are extended herein so that they apply to the nodes in a transfinite graph of a certain kind.
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…
We extend the notion of unicorn paths between two arcs introduced by Hensel, Przytycki and Webb to the case where we replace one arc with a geodesic asymptotic to a lamination. Using these paths, we give new proofs of the results of…
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…
It is often thought that emergent phenomena in topological phases of matter are destroyed when tuning to a critical point. In particular, topologically protected edge states supposedly delocalize when the bulk correlation length diverges.…
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
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…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
In 1980, Thomassen stated his weak linkage conjecture: for an odd positive integer k, if a graph G is k-edge-connected, then, for any collection of k pairs of vertices {s_1,t_1}, ..., {s_k,t_k} in G, not necessarily distinct, there are…