Related papers: Genus Bounds for Harmonic Group Actions on Finite …

We consider large finite group-actions on surfaces and discuss and compare various notions for such actions: Hurwitz actions and Hurwitz groups; maximal reducible and completely reducible actions; bounding and geometrically bounding…

In previous work, all finite simple groups that act with fixity 4 have been classified. In this article we investigate which ones of these groups act faithfully on a compact Riemann surface of genus at least 2 with fixity four in total and…

Let $G$ be the symmetric group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph $G$. If many maximal matchings have a size close to $\maxM(G)$, this graph invariant has a value close to 1.…

The present work completes the classification of the compact Riemann surfaces of genus g with an analytic automorphism of order p (prime number) and p > g. More precisely, we construct a parameteriza- tion space for them, we compute their…

Harmonic functions $u:{\mathbb R}^n \to {\mathbb R}^m$ are equivalent to integral manifolds of an exterior differential system with independence condition $(M,{\mathcal I},\omega)$. To this system one associates the space of conservation…

Let $G$ be a distance-regular graph of order $v$ and size $e$. In this paper, we show that the max-cut in $G$ is at most $e(1-1/g)$, where $g$ is the odd girth of $G$. This result implies that the independence number of $G$ is at most…

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a novel upper bound on the maximum anti-forcing number of $G$…

The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…

This is a survey on upper and lower bounds for finite group actions on bounded surfaces, 3-dimensional handlebodies and closed handles, handlebodies in arbitrary dimensions and finite graphs (the common feature of these objects is that all…

We describe the action of the mapping class group $M(g,n)$ on the fundamental group of $T_{g,n}$, a compact orientable topological surface of positive genus $g$ with $n$ marked points. This is achieved by computing the image of the…

The size of a largest independent set of vertices in a given graph $G$ is denoted by $\alpha(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether…

Let $\Sigma_g (g>1)$ be a closed surface embedded in $S^3$. If a group $G$ can acts on the pair $(S^3, \Sigma_g)$, then we call such a group action on $\Sigma_g$ extendable over $S^3$. In this paper we show that the maximum order of…

A homomorphism of a signed graph $(G, \sigma)$ to $(H, \pi)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and the product of signs of closed walks are preserved.…

It is shown that certain diffeomorphism or homeomorphism groups with no restriction on support of an open manifold with finite number of ends are bounded. It follows that these groups are uniformly perfect. In order to characterize the…

Let $G$ be a graph of order $n$ and size $m$, and let $\mathrm{mc}_{k}\left( G\right) $ be the maximum size of a $k$-cut of $G.$ It is shown that \[ \mathrm{mc}_{k}\left( G\right) \leq\frac{k-1}{k}\left( m-\frac{\mu_{\min }\left( G\right)…

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…

A classical result of Erd\H{o}s and Gallai determines the maximum size $m(n,\nu)$ of a graph $G$ of order $n$ and matching number $\nu n$. We show that $G$ has factorially many maximum matchings provided that its size is sufficiently close…

The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on $n$ vertices of diameter greater than two is at least $n/C$ for some universal constant…

In this paper we classify all Riemann surfaces having a large abelian group of automorphisms, that is having an abelian group of automorphism of order strictly bigger then $4(g-1)$, where $g$ denotes as usual the genus of the Riemann…