A crossing lemma for Jordan curves (Q1647400): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2018.03.015 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963297325 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124968975 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.02077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lenses in arrangements of pseudo-circles and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Line Arrangements: Duality, Algorithms, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting circles into pseudo-segments and improved bounds for incidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On levels in arrangements of curves, iii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for planar \(k\)-sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on curve tangencies and orthogonalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator theorems and Turán-type results for planar intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for String Graphs and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs and incomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial partitioning for a set of varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in discrete analogs of the Kakeya problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinct distance estimates and low degree polynomial partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős distinct distances problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection reverse sequences and geometric applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Separators in String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting curves in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the Richter-Thomassen Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Incidences Between Points and Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangencies between families of disjoint regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intersections of systems of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Incidences Between Points and Circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in discrete geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial distinction between the Euclidean and projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to cut pseudoparabolas into segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2018.03.015 / rank
 
Normal rank

Latest revision as of 00:45, 11 December 2024

scientific article
Language Label Description Also known as
English
A crossing lemma for Jordan curves
scientific article

    Statements

    A crossing lemma for Jordan curves (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2018
    0 references
    extremal problems
    0 references
    combinatorial geometry
    0 references
    arrangements of curves
    0 references
    crossing lemma
    0 references
    separators
    0 references
    contact graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers