Related papers: Bridge position and the representativity of spatia…

We prove that if a graph contains the complete bipartite graph $K_{134, 12}$ as an induced minor, then it contains a cycle of length at most~12 or a theta as an induced subgraph. With a longer and more technical proof, we prove that if a…

Let $f: S^2 \to S^2$ be an expanding branched covering map of the sphere to itself with finite postcritical set $P_f$. Associated to $f$ is a canonical quasisymmetry class $\GGG(f)$ of Ahlfors regular metrics on the sphere in which the…

Suppose that $N$ is a smooth manifold with a smooth Riemannian metric $g_0$, and that $\Gamma$ is a smooth submanifold of $N$. This paper proves that for a generic (in the sense of Baire category) smooth metric $g$ conformal to $g_0$, if…

For a split graph $S$, the combinatorics of 2-switches on $S$ is faithfully encoded by the factor graph $\Phi(S)$, a multigraph whose induced cycles have length at most $4$. In this paper we address the following question: for which $n \in…

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)$.…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

For a graph G embedded in an orientable surface \Sigma, we consider associated links L(G) in the thickened surface \Sigma \times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon…

We study surface groups $\Gamma$ in $SO(4,1)$, which is the group of Mobius tranformations of $S^3$, and also the group of isometries of $\mathbb{H}^4$. We consider such $\Gamma$ so that its limit set $\Lambda_\Gamma$ is a quasi-circle in…

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

The distance ideals of graphs are algebraic invariants that generalize the Smith normal form (SNF) and the spectrum of several distance matrices associated with a graph. In general, distance ideals are not monotone under taking induced…

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with…

Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…

Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(3,2,2)$ if there exists a label $m$ such that $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=3$,…

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

The $ k $-configuration space $ B_k\Gamma $ of a topological space $ \Gamma $ is the space of sets of $ k $ distinct points in $ \Gamma $. In this paper, we consider the case where $ \Gamma $ is a graph of circumference at most $1$. We show…

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…

Every graph $\Gamma$ can be embedded in the plane with a minimal number of edge intersections, called its classical crossing number $\text{cross}\left(\Gamma\right)$. In this paper, we prove that if $\Gamma$ is a metric graph it can be…