On loops intersecting at most once

DOI10.1007/S00039-019-00517-0zbMATH Open1435.57020OpenAlexW2983900451WikidataQ126840610 ScholiaQ126840610MaRDI QIDQ2009028FDOQ2009028

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

Recommendations

• Packing curves on surfaces with few intersections
• Arcs intersecting at most once
• Large collections of curves pairwise intersecting exactly once
• Topological designs
• Small filling sets of curves on a surface

Mathematics Subject Classification ID

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

Cites Work

• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Subgroups of Surface Groups are Almost Geometric
• Title not available (Why is that?)
• Bridge number, Heegaard genus and non-integral Dehn surgery
• Title not available (Why is that?)
• Systems of curves on surfaces
• Arcs intersecting at most once
• Topological designs
• Constructing large \(k\)-systems on surfaces
• Title not available (Why is that?)
• Curves intersecting exactly once and their dual cube complexes

Cited In (5)

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

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

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