Large collections of curves pairwise intersecting exactly once

DOI10.1007/S10711-013-9920-8zbMATH Open1303.57018arXiv1210.2797OpenAlexW2015254760MaRDI QIDQ464251FDOQ464251

Authors: Tarik Aougab 

Publication date: 17 October 2014

Published in: Geometriae Dedicata (Search for Journal in Brave)

Abstract: Let $Omega=(omeg{a}_j{)}_{jinI}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_g$, such that $omeg{a}_i$ and $omeg{a}_j$ intersect exactly once for $ieqj$. It was recently demonstrated by Malestein, Rivin, and Theran that the cardinality of such a collection is no more than $2g+1$. In this paper, we show that for $ggeq3$, there exists at least two such collections with this maximum size up to the action of the mapping class group, answering a question posed by Malestein, Rivin and Theran.

Full work available at URL: https://arxiv.org/abs/1210.2797

Recommendations

• Curves intersecting exactly once and their dual cube complexes
• Algebraic \(k\)-systems of curves
• Small filling sets of curves on a surface
• Small intersection numbers in the curve graph
• Systems of curves on surfaces

zbMATH Keywords

combinatorial designssurface topology

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) General low-dimensional topology (57M99)

Cites Work

• A primer on mapping class groups
• Systems of curves on surfaces
• Topological designs
• Minimally intersecting filling pairs on surfaces
• Title not available (Why is that?)

Cited In (7)

• Curves intersecting exactly once and their dual cube complexes
• On loops intersecting at most once
• Topological designs
• Large 1-systems of curves in nonorientable surfaces
• Automorphisms of the \(k\)-curve graph
• Mapping class group orbits of curves with self-intersections
• Filling of closed surfaces

This page was built for publication: Large collections of curves pairwise intersecting exactly once

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464251)