We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the mapping class group.

Given a surface $\Sigma$ equipped with a set P of marked points, we consider the triangulations of $\Sigma$ with vertex set P. The flip-graph of $\Sigma$ is the graph whose vertices are these triangulations, and whose edges correspond to flipping arcs in these triangulations. The flip-graph of a surface appears in the study of moduli spaces and mapping class groups. We consider the number of geodesics in the flip-graph of $\Sigma$ between two triangulations as a function of their distance. We show that this number grows exponentially provided the surface has enough topology, and that in the remaining cases the growth is polynomial.

In this note we show that the expected value of the separating systole of a random surface of genus g with respect to Weil–Petersson volume behaves like $2\log g $ as the genus goes to infinity. This is in strong contrast to the behavior of the expected value of the systole which, by results of Mirzakhani and Petri, is independent of genus.

Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer k, we are interested in the set of all closed geodesics with at least k (but possibly more) self-intersections. Among these, we consider those of minimal length and investigate their self-intersection numbers. We prove that their intersection numbers are upper bounded by a universal linear function in k (which holds for any hyperbolic surface). Moreover, in the presence of cusps, we get bounds which imply that the self-intersection numbers behave asymptotically like k for growing k.

It is a theorem of Bers that any closed hyperbolic surface admits a pants decomposition consisting of curves of bounded length where the bound only depends on the topology of the surface. The question of the quantification of the optimal constants has been well studied, and the best upper bounds to date are linear in genus, due to a theorem of Buser and Seppälä. The goal of this note is to give a short proof of a linear upper bound that slightly improves the best known bound.