Related papers: $n$-arc and $n$-circle connected graph-like spaces

We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine…

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…

The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…

In this paper we consider the hyperspace $C_{n}(X)$ of non-empty and closed subsets of a base space $X$ with up to $n$ connected components. We consider a class of base spaces called finite ray-graphs, which are a noncompact variation on…

We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular types. We establish an exact correspondence between the…

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…

Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…

A topological space is locally equiconnected if there exists a neighborhood $U$ of the diagonal in $X\times X$ and a continuous map $\lambda:U\times[0,1]\to X$ such that $\lambda(x,y,0)=x$, $\lambda(x,y,1)=y$ et $\lambda(x,x,t)=x$ for…

A connected graph $G$ is said to be $k$-connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connected graph $G$ with sufficiently large order, we present a…

In this paper, we study some features of n-normed spaces with respect to norms of its quotient spaces. We define continuous functions with respect to the norms of its quotient spaces and show that all types of continuity are equivalent. We…

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

P. Alexandroff proved that a locally compact $T_2$-space has a $T_2$ one-point compactification (obtained by adding a "point at infinity") if and only if it is non-compact. He also asked for characterizations of spaces which have one-point…

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…

We study the fixed point theory of n-valued maps of a space X using the fixed point theory of maps between X and its configuration spaces. We give some general results to decide whether an n-valued map can be deformed to a fixed point free…

A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges…

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…

It is shown that a.a.s. as soon as a Kronecker graph becomes connected its diameter is bounded by a constant.

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…

We deal with the general problem of connectedness for the space of $\mathbb{Z}^d$ actions by (orientation-preserving) diffeomorphisms of a compact 1-manifold. We prove two results. First, the space of $\mathbb{Z}^d$ actions by $C^2$…