Related papers: Classification of Minimal Separating Sets in Low G…

An isolating set in a graph $G$ is a set $S$ of vertices such that removing $S$ and its neighborhood leaves no edge. The isolation number $\iota(G)$ of $G$ (also known as the vertex-edge domination number) is the minimum size among all…

We give a new, short proof that graphs embeddable in a given Euler genus-$g$ surface admit a simple $f(g)$-round $\alpha$-approximation distributed algorithm for Minimum Dominating Set (MDS), where the approximation ratio $\alpha \le 906$.…

We prove that if $\Sigma$ is a closed surface of genus at least 3 and $G$ is a split real semisimple Lie group of rank at least $3$ acting faithfully by isometries on a symmetric space $N$, then there exists a Hitchin representation…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

We define minimal fusion systems in a way that every non-solvable fusion system has a section which is minimal. Minimal fusion systems can also be seen as analogs of Thompson's N-groups. In this paper, we consider a minimal fusion system…

The goal of this work is to give new quantitative results about the distribution of semi-arithmetic hyperbolic surfaces in the moduli space of closed hyperbolic surfaces. We show that two coverings of genus $g$ of a fixed arithmetic surface…

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…

We consider a series of groups defined by Kim and Manturov. These groups have their background in triangulations of a surface and configurations of points, lines or circles on the surface. They are expected to have relationships to many…

A node separator of a graph is a subset S of the nodes such that removing S and its incident edges divides the graph into two disconnected components of about equal size. In this work, we introduce novel algorithms to find small node…

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…

Suppose that $f$ is a homomorphism from the mapping class group $\mathcal{M}(N_{g,n})$ of a nonorientable surface of genus $g$ with $n$ boundary components, to $\mathrm{GL}(m,\mathbb{C})$. We prove that if $g\ge 5$, $n\le 1$ and $m\le g-2$,…

Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $s,t$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We present an algorithm for…

We prove that orientable index one minimal surfaces in spherical space forms with large fundamental group have genus at most two. This confirms a conjecture of R. Schoen for an infinite class of 3-manifolds.

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

A minimal separator of a graph $G$ is a set $S \subseteq V(G)$ such that there exist vertices $a,b \in V(G) \setminus S$ with the property that $S$ separates $a$ from $b$ in $G$, but no proper subset of $S$ does. For an integer $k\ge 0$, we…

Let $G$ be a finite, connected graph of order of at least 2, with vertex set $V(G)$ and edge set $E (G)$. A set $S$ of vertices of the graph $G$ is a doubly resolving set for $G$ if every two distinct vertices of $G$ are doubly resolved by…

Determining the minimum genus of a graph is a fundamental optimisation problem in the study of network design and implementation as it gives a measure of non-planarity of graphs. In this paper, we are concerned with determining the smallest…

We consider the function $f(g)$ that assigns to an orientable surface $M$ of genus $g$ the maximal number of free commuting independent involutions on $M$. We show that the surface of minimal genus $g$ with $f(g)=n$ is a real moment-angle…

We prove the existence of minimal surfaces in a bounded convex subset of $\mathbb R^3$, $\mathcal M$, intersecting the boundary of $\mathcal M$ with a fixed contact angle. The proof is based on a min-max construction in the spirit of…

We find the minimal number of self-intersections of the boundary of a surface of genus g generically immersed in the plane.