Pages that link to "Item:Q4354594"

The following pages link to Crossing Numbers and Hard Erdős Problems in Discrete Geometry (Q4354594):

Displaying 50 items.

• The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
• On sets of directions determined by subsets of \(\mathbb R^d\) (Q351365) (← links)
• Crossings in grid drawings (Q405129) (← links)
• Progress on Dirac's conjecture (Q405200) (← links)
• Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
• An incidence theorem in higher dimensions (Q452010) (← links)
• On totally positive matrices and geometric incidences (Q458293) (← links)
• Drawing outerplanar graphs using three edge lengths (Q482350) (← links)
• Szemerédi-Trotter-type theorems in dimension 3 (Q482631) (← links)
• On locally Gabriel geometric graphs (Q497339) (← links)
• Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\) (Q507475) (← links)
• Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
• The number of unit distances is almost linear for most norms (Q624331) (← links)
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
• On the connectivity of visibility graphs (Q715001) (← links)
• Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
• A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661) (← links)
• Distinct distances in planar point sets with forbidden 4-point patterns (Q776292) (← links)
• Distinct distances with \(\ell_p\) metrics (Q824324) (← links)
• On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
• On triple intersections of three families of unit circles (Q908211) (← links)
• Near optimal bounds for the Erdős distinct distances problem in high dimensions (Q949786) (← links)
• A note on the number of different inner products generated by a finite set of vectors (Q966051) (← links)
• A bipartite strengthening of the crossing Lemma (Q968451) (← links)
• Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
• Degenerate crossing numbers (Q1014334) (← links)
• Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
• On distinct distances among points in general position and other related problems (Q1046803) (← links)
• Cardinalities of \(k\)-distance sets in Minkowski spaces (Q1292877) (← links)
• On distinct sums and distinct distances. (Q1418004) (← links)
• A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
• Additive combinatorics and graph theory (Q1620873) (← links)
• The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
• Distinct distances between points and lines (Q1702254) (← links)
• The number of crossings in multigraphs with no empty lens (Q1725755) (← links)
• On the \(k\)-planar local crossing number (Q1727762) (← links)
• Algebraic methods in sum-product phenomena (Q1760327) (← links)
• A combinatorial problem on polynomials and rational functions (Q1971011) (← links)
• On loops intersecting at most once (Q2009028) (← links)
• Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
• On the number of edges of separated multigraphs (Q2151445) (← links)
• An incidence estimate and a Furstenberg type estimate for tubes in \(\mathbb{R}^2\) (Q2154364) (← links)
• On distinct distances between a variety and a point set (Q2161208) (← links)
• The crossing number of twisted graphs (Q2163801) (← links)
• A crossing lemma for multigraphs (Q2189737) (← links)
• Rotation and crossing numbers for join products (Q2210206) (← links)
• Solving linear equations in a vector space over a finite field (Q2231719) (← links)
• Many touchings force many crossings (Q2312603) (← links)
• Distinct distance estimates and low degree polynomial partitioning (Q2340417) (← links)
• Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm (Q2341926) (← links)