Related papers: Turaev genus and alternating decompositions

We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…

We study, for plane complex branches of genus one, the topological type of its generic polar curve, as a function of the semigroup of values and the Zariski invariant of the branch. We improve some results given by Casas-Alvero in 2023,…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We prove bounds on the chromatic number $\chi$ of a vertex-transitive graph in terms of its clique number $\omega$ and maximum degree $\Delta$. We conjecture that every vertex-transitive graph satisfies $\chi \le \max \left\{\omega,…

A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of…

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…

We say that an edge colouring breaks an automorphism if some edge is mapped to an edge of a different colour. We say that the colouring is distinguishing if it breaks every non-identity automorphism. We show that such colouring can be…

We show that there exist genus one curves of every index over the rational numbers, answering affirmatively a question of Lang and Tate. The proof is "elementary" in the sense that it does not assume the finiteness of any Shafarevich-Tate…

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

In "A survey on the Turaev genus of knots," Champanerkar and Kofman propose several open questions. The first asks whether the polynomial whose coefficients count the number of quasi-trees of the all-A ribbon graph obtained from a diagram…

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

We show that every countable subgroup $G<\rm GL_+(2,\mathbb{R})$ without contracting elements is the Veech group of a tame translation surface $S$ of infinite genus, for infinitely many different topological types of $S$. Moreover, we prove…

Given a field with a set of discrete valuations $V$, we show how the genus of a division algebra over the field is related to the genus of the residue algebras at various valuations in $V$ and the ramification data. When the division…

For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

In this paper, we study the group and list group colorings of total graphs and we give two group versions of the total and list total colorings conjectures. We establish the group version of the total coloring conjecture for the following…