Related papers: Universal geometric non-embedding of random regula…

A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…

We obtain an explicit formula for the quadratic embedding constant (QEC) of a strongly regular graph $\mathrm{srg}(n,k,\lambda,\mu)$ with $\mu\ge1$. By using QEC we give a necessary and sufficient condition for a strongly regular graph to…

A graph $G$ is called universal for a family of graphs $\mathcal{F}$ if it contains every element $F \in \mathcal{F}$ as a subgraph. Let $\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh…

The open question of what prevents a metric space with bounded geometry from being uniformly embeddable in Hilbert space is answered here for box spaces of residually finite groups. We prove that a box space does not contain a uniformly…

The Urysohn space is the unique separable metric space that is universal and homogeneous for finite metric spaces, i.e., it embeds any finite metric space any isometry between finite subspaces extends to an isometry of the whole space. We…

In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c_1 (log n). A typical…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…

In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

In this paper we deduce a local deformation lemma for uniform embeddings in a metric covering space over a compact manifold from the deformation lemma for embeddings of a compact subspace in a manifold. This implies the local…

We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…

In this article we provide a general construction when $n\ge3$ for immersed in Euclidean $(n+1)$-space, complete, smooth, constant mean curvature hypersurfaces of finite topological type (in short CMC $n$-hypersurfaces). More precisely our…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…

The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…

For $S \subseteq \mathbb{R}$, positive integer $n$, and $d > 0$, let $G(S^n, d)$ be the graph whose vertex set is $S^n$ where any two vertices are adjacent if and only if they are Euclidean distance $d$ apart. The primary question we will…

An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in…

A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…