Related papers: Knotted Spheres and Graphs in Balls

We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with…

A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and the other edges of $E$…

It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…

Let (R, m) be the semigroup ring associated to a numerical semigroup S. In this paper we study the property of its associated graded ring G(m) to be Complete Intersection. In particular, we introduce and characterise beta-rectangular and…

In this work, we consider $M=(\mathbb{B}^3_r,\bar{g})$ as the Euclidean three-ball with radius $r$ equipped with the metric $\bar{g}=e^{2h}\left\langle , \right\rangle$ conformal to the Euclidean metric. We show that if a free boundary CMC…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…

We prove Wise's $W$-cycles conjecture. Consider a compact graph $\Gamma'$ immering into another graph $\Gamma$. For any immersed cycle $\Lambda:S^1\to \Gamma$, we consider the map $\Lambda'$ from the circular components $\mathbb{S}$ of the…

Answering a question of Wright, we show that spheres of any radius are always connected in the curve graph of surfaces $\Sigma_{2,0}, \Sigma_{1,3},$ and $\Sigma_{0,6}$, and the union of two consecutive spheres is always connected for…

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study…

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Let $G$ be a graph in which each edge is assigned one of the colours $1, 2, \ldots, m$, and let $\Gamma$ be a subgroup of $S_m$. The operation of switching at a vertex $x$ of $G$ with respect to an element $\pi$ of $\Gamma$ permutes the…

Let \Sigma be a k-dimensional minimal surface in the unit ball B^n which meets the unit sphere orthogonally. We show that the area of \Sigma is bounded from below by the volume of the unit ball in R^k. This answers a question posed by R.…

The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…

A signed graph is a graph whose edges are given (-1,+1) weights. In such a graph, the sign of a cycle is the product of the signs of its edges. A signed graph is called balanced if its adjacency matrix is similar to the adjacency matrix of…

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Given a graph $\Gamma$, the right-angled Artin group $A(\Gamma)$ is given by the presentation $\langle u \in V(\Gamma) \mid [u,v]=1, \ \{u,v\} \in E(\Gamma) \rangle$. The Embedding Problem in right-angled Artin groups asks, given two finite…

A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.

Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse…

Let $\Gamma=(G, \sigma)$ be a signed graph of order $n$ with underlying graph $G$ and a sign function $\sigma: E(G)\rightarrow \{+, -\}$. Denoted by $i_+(\Gamma)$, $\theta(\Gamma)$ and $p(\Gamma)$ the positive inertia index, the cyclomatic…