On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
From MaRDI portal
Publication:5366928
DOI10.1017/S0963548316000043zbMath1372.52029arXiv1412.6676WikidataQ123196721 ScholiaQ123196721MaRDI QIDQ5366928
János Pach, Natan Rubin, Gábor Tardos
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6676
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Extremal combinatorics (05D99) Combinatorial complexity of geometric structures (52C45)
Related Items
A crossing lemma for Jordan curves, On the number of tangencies among 1-intersecting \(x\)-monotone curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incidence theorem in higher dimensions
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- A combinatorial distinction between the Euclidean and projective planes
- Extremal problems in discrete geometry
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- On the intersections of systems of curves
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- How to cut pseudoparabolas into segments
- On levels in arrangements of curves
- Cutting circles into pseudo-segments and improved bounds for incidences
- Intersecting curves in the plane
- On levels in arrangements of curves. II: A simple inequality and its consequences
- Intersection reverse sequences and geometric applications.
- Research Problems in Discrete Geometry
- Crossings between Curves with Many Tangencies
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Lenses in arrangements of pseudo-circles and their applications
- Discretional Convexity and the Maximum Principle for Discrete Systems
- On Sets of Distances of n Points
