On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
DOI10.1017/S0963548316000043zbMATH Open1372.52029arXiv1412.6676WikidataQ123196721 ScholiaQ123196721MaRDI QIDQ5366928FDOQ5366928
Authors: 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
Recommendations
- On the Richter-Thomassen conjecture about pairwise intersecting closed curves
- On s -intersecting curves and related problems
- scientific article; zbMATH DE number 3929148
- On Halpern's Conjecture for Closed Plane Curves
- scientific article; zbMATH DE number 3966308
- Intersecting curves (Variation on an observation of Maxim Kontsevich)
- Intersecting curves and algebraic subgroups: Conjectures and more results
- scientific article; zbMATH DE number 819100
- ON TOTARO'S THEOREM FOR CLOSED SPACE CURVES
- The Pierce-Birkhoff Conjecture for Curves
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) Combinatorial complexity of geometric structures (52C45) Extremal combinatorics (05D99)
Cites Work
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Title not available (Why is that?)
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On Sets of Distances of n Points
- A combinatorial distinction between the Euclidean and projective planes
- Extremal problems in discrete geometry
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- An incidence theorem in higher dimensions
- Discretional Convexity and the Maximum Principle for Discrete Systems
- Cutting circles into pseudo-segments and improved bounds for incidences
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- Lenses in arrangements of pseudo-circles and their applications
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- How to cut pseudoparabolas into segments
- On levels in arrangements of curves. II: A simple inequality and its consequences
- Intersection reverse sequences and geometric applications.
- On levels in arrangements of curves
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- Intersecting curves in the plane
- On the intersections of systems of curves
- Crossings between curves with many tangencies
Cited In (4)
This page was built for publication: On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366928)