Related papers: Alternating maps on Hatcher-Thurston graphs

Motivated by the successful application of geometry to proving the Harary-Hill Conjecture for "pseudolinear" drawings of $K_n$, we introduce "pseudospherical" drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit…

Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…

A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The $\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an independently even…

This paper extends some results of Hatcher and Quinn beyond the metastable range. We give a bordism theoretic obstruction to deforming a map between manifolds simultaneously off of a collection of pairwise disjoint submanifolds under the…

We describe each multiple curve on the orientable surface of genus-$g$ with $n$ punctures and one boundary component by using this multiple curve's geometric intersection number with the embedded curves in this surface.

A graph $G$ is $H$-saturated for a graph $H$, if $G$ does not contain a copy of $H$ but adding any new edge to $G$ results in such a copy. An $H$-saturated graph on a given number of vertices always exists and the properties of such graphs,…

An alternating cycle in a 2-two-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let $G_1, \ldots, G_k$ be a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum…

For a $2$-connected graph $G$ and vertices $u,v$ of $G$ we define an abstract graph $\mathcal{P}(G_{uv})$ whose vertices are the paths joining $u$ and $v$ in $G$, where paths $S$ and $T$ are adjacent if $T$ is obtained from $S$ by replacing…

Let $R$ be a compact, connected, orientable surface of genus $g$, $Mod_R^*$ be the extended mapping class group of $R$, $\mathcal{C}(R)$ be the complex of curves on $R$, and $\mathcal{N}(R)$ be the complex of nonseparating curves on $R$. We…

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…

The Laplacian matrix of a graph $G$ is denoted by $L(G)=D(G)-A(G)$, where $D(G)=diag(d(v_{1}),\ldots , d(v_{n}))$ is a diagonal matrix and $A(G)$ is the adjacency matrix of $G$. Let $G_1$ and $G_2$ be two graphs. A one-edge connection of…

The bipartite-hole-number of a graph $G$, denoted as $\widetilde{\alpha}(G)$, is the minimum number $k$ such that there exist positive integers $s$ and $t$ with $s+t=k+1$ with the property that for any two disjoint sets $A,B\subseteq V(G)$…

After Fossas-Parlier, we consider two graphs $\mathcal{G}_{0}(S)$ and $\mathcal{G}_{\infty}(S)$, constructed from multicurves on connected, orientable surfaces of infinite-type. Our first result asserts that $\mathcal{G}_{\infty}(S)$ has…

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in…

Let $S$ be a closed Riemann surface of genus $g(\geqq 2)$ and set $\dot{S}=S \setminus \{\hat{z}_0 \}$. Then we have the composed map $\varphi\circ r$ of a map $r: T(S) \times U \rightarrow F(S)$ and the Bers isomorphism $\varphi: F(S)…

Let $B(H)$ be the algebra of all bounded linear operators on an infinite-dimensional complex Hilbert space $H$. For $T \in B(H)$ and $\lambda \in \mathbb{C}$, let $H_{T}(\{\lambda\})$ denotes the local spectral subspace of $T$ associated…

Let $S$ be a Riemann surface of type $(p,n)$ with $3p+n>4$ and $n\geq 1$. Let $\alpha_1,\alpha_2\subset S$ be two simple closed geodesics such that $\{\alpha_1, \alpha_2\}$ fills $S$. It was shown by Thurston that most maps obtained through…

We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prove a sharp threshold result for the appearance of G_{n,p_1}…

A graph $G$ belongs to the class ${\rm ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,{\cal S})$, where $T$ is a tree of maximum degree at most $h$, and ${\cal S}$ is a collection $(S_u)_{u\in V(G)}$ of subtrees $S_u$…

We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to…