Related papers: Prescribed Arc Graphs

We study the ideal triangulation graph $T(S)$ of a punctured surface $S$ of finite type. We show that if $S$ is not the sphere with at most three punctures or the torus with one puncture, then the natural map from the extended mapping class…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

$\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of "non-expander"…

Let $G=(V,E)$ be a connected graph with the usual (graph) distance metric $d:V \times V \to N \cup \{0 \}$. Introduced by Gromov, $G$ is $\delta$-hyperbolic if for every four vertices $u,v,x,y \in V$, the two largest values of the three…

Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

We prove that any weakly acausal curve $\Gamma$ in the boundary of Anti-de Sitter (2+1)-space is the asymptotic boundary of two spacelike $K$-surfaces, one of which is past-convex and the other future-convex, for every $K\in(-\infty,-1)$.…

Let $D$ be a strongly connected digraph. An arc set $S$ of $D$ is a \emph{restricted arc-cut} of $D$ if $D-S$ has a non-trivial strong component $D_{1}$ such that $D-V(D_{1})$ contains an arc. The \emph{restricted arc-connectivity}…

The fine curve graph of a surface is a graph whose vertices are essential simple closed curves and whose edges connect disjoint curves. Following a rich history of hyperbolicity of various graphs associated to surfaces, the fine curve graph…

Given a finite graph $\Gamma$, the associated graph braid group $B_n(\Gamma)$ is the fundamental group of the unordered $n$-point configuration space of $\Gamma$. Genevois classified which graph braid groups are Gromov hyperbolic and asked…

We prove three results about the graph product $G=\G(\Gamma;G_v, v \in V(\Gamma))$ of groups $G_v$ over a graph $\Gamma$. The first result generalises a result of Servatius, Droms and Servatius, proved by them for right-angled Artin groups;…

Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…

In this paper we consider a set $E\subset\Omega$ with prescribed mean curvature $f\in C(\Omega)$ and Euclidean Lipschitz boundary $\partial E=\Sigma$ inside a three-dimensional contact sub-Riemannian manifold $M$. We prove that if $\Sigma$…

The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the…

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

In this article, we initiate a geometric study of graph braid groups. More precisely, by applying the formalism of special colorings introduced in a previous article, we determine precisely when a graph braid group is Gromov-hyperbolic,…

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written…

We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…

The arc graph $\delta(G)$ of a digraph $G$ is the digraph with the set of arcs of $G$ as vertex-set, where the arcs of $\delta(G)$ join consecutive arcs of $G$. In 1981, Poljak and R\"{o}dl characterised the chromatic number of $\delta(G)$…

If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic (in the Gromov sense)…