Related papers: Metric graphs of negative type
In this paper, we introduce the nonstandard vector space in which the concept of additive inverse element will not be taken into account. We also consider a metric defined on this nonstandard vector space. Under these settings, the…
A graph is nearly embedded in a surface if it consists of graph $G_0$ that is embedded in the surface, together with a bounded number of vortices having no large transactions. It is shown that every large wall (or grid minor) in a nearly…
Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…
A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…
We establish curvature obstruction theorems for manifolds with boundary. Our main theorems show that, for dimensions up to 7, a topologically nontrivial compact manifold with boundary cannot have a metric of positive $m$-intermediate…
A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…
This paper addresses Cheeger and Gromoll's question of which vector bundles admit a complete metric of nonnegative curvature, and relates their question to the issue of which sphere bundles admit a metric of positive curvature. We show that…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
Given a graph $G = (V,E)$, a set $S \subset V$ is called a $k$-\emph{metric generator} for $G$ if any pair of different vertices of $G$ is distinguished by at least $k$ elements of $S$. A graph is $k$-\emph{metric dimensional} if $k$ is the…
Let $G$ be a graph on $n$ vertices, independence number $\alpha(G)$, Lov\'asz theta function $\vartheta(G)$, and Shannon capacity $\Theta(G)$. We define $n_{\ge0}(G)$ to be the minimum number of non-negative eigenvalues taken over all…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
In this article, we are interested in metric spaces that satisfy a weak non-positive curvature condition in the sense that they admit a conical geodesic bicombing. We show that the analog of a question of Gromov about compactness properties…
We consider a smooth closed surface $M$ of fixed genus $\geqslant 2$ with a Riemannian metric $g$ of negative curvature with fixed total area. The second author has shown that the topological entropy of geodesic flow for $g$ is greater than…
We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…
We show that graph-theoretic thickness and geometric thickness are not asymptotically equivalent: for every t, there exists a graph with thickness three and geometric thickness >= t.
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…