2000 character limit reached
Crossing lemmas for $k$-systems of arcs
Published 22 Mar 2024 in math.CO and cs.CG | (2403.15261v2)
Abstract: We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.
- A. Girao and F. Illingworth and A. Scott and D. R. Wood. Non-Homotopic Drawings of Multigraphs. Arxiv 2401.10615 (2024).
- J. Greene. On loops intersecting at most once. Geometric and Functional Analysis. volume 29, pages 1828 ? 1843 (2019)
- J. Greene. On curves intersecting at most once II. https://arxiv.org/abs/1811.01413 , (2018).
- J. Pach and G. Tóth. A crossing lemma for multigraphs. https://arxiv.org/abs/1801.00721. (2018)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.