Related papers: Crossing number inequalities for curves on surface…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
We consider various equivalence relations on the set of homotopy classes of curves on a hyperbolic surface based on topological, algebraic, and geometric structures. The purpose of this work is to determine the relationship between these…
On a general hypersurface of degree $d\leq n$ in $\mathbb P^n$ or $\mathbb P^n$ itself, we prove the existence of curves of any genus and high enough degree depending on the genus passing through the expected number $t$ of general points or…
We show that the number of simple closed geodesics of length bounded by L on a hyperbolic surface of genus g with c cusps and b boundary components grows roughly like L^{6g+2b+2c-6}. This has been conjectured for some time.
In this paper we consider developable surfaces which are isometric to planar domains and which are piecewise differentiable, exhibiting folds along curves. The paper revolves around the longstanding problem of existence of the so-called…
A longstanding avenue of research in orientable surface topology is to create and enumerate collections of curves in surfaces with certain intersection properties. We look for similar collections of curves in non-orientable surfaces. A…
We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.
We prove algebraic analogues of the facts that a curve on a surface with self-intersection number zero is homotopic to a cover of a simple curve, and that two simple curves on a surface with intersection number zero can be isotoped to be…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
In this paper, we consider the automorphisms of fine curve graphs restricted to continuously $k$-differentiable curves. We show that for closed surfaces with genus at least 2, they are induced by homeomorphisms of the surface.
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions…
We define a new variant of Rabinowitz Floer homology that is particularly well suited to studying the growth rate of leaf-wise intersections. We prove that for closed manifolds $M$ whose loop space is "complicated", if $\Sigma$ is a…
Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…
Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge…
In this note, we develop a condition on a closed curve on a surface or in a 3-manifold that implies that the curve has the property that its length function on the space of all hyperbolic structures on the surface or 3-manifold completely…
We study 3-plane drawings, that is, drawings of graphs in which every edge has at most three crossings. We show how the recently developed Density Formula for topological drawings of graphs (KKKRSU GD 2024) can be used to count the…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…