Related papers: Classifying edge-biregular maps of negative prime …
Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…
We study the regularity of binomial edge ideals. For a closed graph $G$ we show that the regularity of the binomial edge ideal $J_G$ coincides with the regularity of $\ini_{\lex}(J_G)$ and can be expressed in terms of the combinatorial data…
We classify supersingular and classical Enriques surfaces with finite automorphism group in characteristic 2 into 8 types according to their dual graphs of all $(-2)$-curves (nonsigular rational curves). We give examples of these Enriques…
An orientation-preserving recurrent homeomorphism of the two-sphere which is not the identity is shown to admit exactly two fixed points. A recurrent homeomorphism of a compact surface with negative Euler characteristic is periodic.
A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…
We study the geometry and topology of Hilbert schemes of points on the orbifold surface [C^2/G], respectively the singular quotient surface C^2/G, where G is a finite subgroup of SL(2,C) of type A or D. We give a decomposition of the…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
The authors give a short survey of previous results on $\delta$-homogeneous Riemannian manifolds, forming a new proper subclass of geodesic orbit spaces with non-negative sectional curvature, which properly includes the class of all normal…
We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.
A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…
We classify biharmonic submanifolds with certain geometric properties in Euclidean spheres. For codimension 1, we determine the biharmonic hypersurfaces with at most two distinct principal curvatures and the conformally flat biharmonic…
The mapping class group of a non-exceptional oriented surface of finite type admits a biautomatic structure.
We define the notion of an exceptional manifold to be a flat Riemannian manifold with boundary which supports a positive harmonic function satisfying simultaneously a zero Dirichlet condition and a constant (nonzero) Neumann condtion at the…
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
A finite simple graph is called a 2-graph if all of its unit spheres S(x) are cyclic graphs of length 4 or larger. A 2-graph G is Eulerian if all vertex degrees of G are even. An edge refinement of a graph splits an edge (a,b) to two edges…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…
A finite simple graph is called a bi-Cayley graph over a group $H$ if it has a semiregular automorphism group, isomorphic to $H,$ which has two orbits on the vertex set. Cubic vertex-transitive bi-Cayley graphs over abelian groups have been…
A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.