Related papers: Complexes of nearly maximum diameter

We study the asymptotic behavior of the maximum interpoint distance of random points in a $d$-dimensional set with a unique diameter and a smooth boundary at the poles. Instead of investigating only a fixed number of $n$ points as $n$ tends…

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

We consider self-repelling elastic manifolds with a domain $[-N,N]^d \cap \mathbb{Z}^d$, that take values in $\mathbb{R}^D$. Our main result states that when the dimension of the domain is $d=2$ and the dimension of the range is $D=1$, the…

A graph is called radially maximal if it is not complete and the addition of any new edge decreases its radius. In 1976 Harary and Thomassen proved that the radius $r$ and diameter $d$ of any radially maximal graph satisfy $r\le d\le 2r-2.$…

Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$…

We investigate the giant component formed via high-dimensional paths in the multi-parameter random simplicial complex (MRSC) model. For a $d$-dimensional simplicial complex, we define $d$-dimensional connectivity through incidence between…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…

We consider the multi-parameter random simplicial complex as a higher dimensional extension of the classical Erd\"os-R\'enyi graph. We investigate appearance of "unusual" topological structures in the complex from the point of view of large…

For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…

For any integer $n\geq 2$, we prove that for any large enough integer $d$, with large probability the injectivity radius of a random degree $d$ complex hypersurface in $\C P^n$ is larger than $d^{-\frac{1}2(3n+2)}$. Here the hypersurface is…

Let $M$ be the interior of a connected, oriented, compact manifold $V$ of dimension at least 2. If each path component of $\partial V$ has amenable fundamental group, then we prove that the simplicial volume of $M$ is equal to the relative…

An $n$-tuple $D=(d(1),\dots,d(n))$ is a \emph{feasible degree sequence} if there is a graph on $\{1,\dots,n\}$ such that $i$ has degree $d(i)$. Any such graph will have $m=\sum_{i=1}^n d(i)/2$ edges. Letting $G(D)$ be a graph chosen…

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…

The fractal properties of four-dimensional Euclidean simplicial manifold generated by the dynamical triangulation are analyzed on the geodesic distance D between two vertices instead of the usual scale between two simplices. In order to…

A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a graph in order to make the resulting graph have diameter D.…

We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…

A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs…