On loops intersecting at most once

DOI10.1007/s00039-019-00517-0zbMath1435.57020OpenAlexW2983900451WikidataQ126840610 ScholiaQ126840610MaRDI QIDQ2009028

Joshua Evan Greene

Publication date: 27 November 2019

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00039-019-00517-0

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Graph representations (geometric and intersection representations, etc.) (05C62) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Curves on the torus intersecting at most k times ⋮ Large 1-systems of curves in nonorientable surfaces ⋮ Approximating maximum integral multiflows on bounded genus graphs ⋮ Algebraic \(k\)-systems of curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing large \(k\)-systems on surfaces
• Systems of curves on surfaces
• Arcs intersecting at most once
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Curves intersecting exactly once and their dual cube complexes
• Topological designs
• Subgroups of Surface Groups are Almost Geometric
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Bridge number, Heegaard genus and non-integral Dehn surgery

This page was built for publication: On loops intersecting at most once