Crossing Numbers and Hard Erdős Problems in Discrete Geometry
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sets with few distinct distances do not have heavy lines
- Distinct distances from three points
- Crossings Between Non-homotopic Edges
- Geometric incidence theorems via Fourier analysis
- Additive combinatorics and graph theory
- Sumsets of semiconvex sets
- On distinct distances between a variety and a point set
- Graph minors and the crossing number of graphs
- On rich points and incidences with restricted sets of lines in 3-space
- Some provably hard crossing number problems
- On the number of edges of separated multigraphs
- Distinct distances with \(\ell_p\) metrics
- Rotation and crossing numbers for join products
- Incidences with curves in \(\mathbb{R}^d\)
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- The number of crossings in multigraphs with no empty lens
- On the \(k\)-planar local crossing number
- Solving linear equations in a vector space over a finite field
- A note on the number of different inner products generated by a finite set of vectors
- Crossing numbers of imbalanced graphs
- The number of crossings in multigraphs with no empty lens
- Rational distances with rational angles
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Crossings in grid drawings
- A bipartite strengthening of the crossing Lemma
- On the diameter of separated point sets with many nearly equal distances
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- Unit distances and diameters in Euclidean spaces
- On a Question of Bourgain about Geometric Incidences
- Unit and distinct distances in typical norms
- A crossing lemma for multigraphs
- On the number of incidences when avoiding an induced biclique in geometric settings
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
- On loops intersecting at most once
- On the number of edges of separated multigraphs
- Nearly equal distances and Szemerédi's regularity lemma
- Improved bounds for incidences between points and circles
- Szemerédi-Trotter-type theorems in dimension 3
- Iterated point-line configurations grow doubly-exponentially
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Classification of maps sending lines into translates of a curve
- On bipartite distinct distances in the plane
- Crossing Numbers and Parameterized Complexity
- The Szemerédi-Trotter theorem in the complex plane
- Cardinalities of k-distance sets in Minkowski spaces
- On distinct distances among points in general position and other related problems
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- On totally positive matrices and geometric incidences
- Complexity of non-abelian cut-and-project sets of polytopal type. I: Special homogeneous Lie groups
- Incidences with curves in \(\mathbb{R}^{d}\)
- General lower bounds for the minor crossing number of graphs
- Degenerate crossing numbers
- A Szemerédi-Trotter type theorem in R^4
- Distinct distances on non-ruled surfaces and between circles
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- A Bipartite Strengthening of the Crossing Lemma
- An incidence theorem in higher dimensions
- From art and circuit design to geometry and combinatorics
- An incidence estimate and a Furstenberg type estimate for tubes in \(\mathbb{R}^2\)
- Distinct distances between points and lines
- Extremal problems on triangle areas in two and three dimensions
- Structure and generation of crossing-critical graphs
- The Dirac-Goodman-Pollack conjecture
- The number of unit distances is almost linear for most norms
- The crossing number of locally twisted cubes \(L T Q_n\)
- On forbidden configurations in point-line incidence graphs
- Extremal problems for geometric hypergraphs
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- On the number of digons in arrangements of pairwise intersecting circles
- On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem
- Drawing outerplanar graphs using three edge lengths
- Space crossing numbers
- Incidences in three dimensions and distinct distances in the plane
- Crossings between non-homotopic edges
- On distinct sums and distinct distances.
- Unit distances in three dimensions
- On sets of directions determined by subsets of \(\mathbb R^d\)
- Radial points in the plane
- Finite point configurations in the plane, rigidity and Erdős problems
- From harmonic analysis to arithmetic combinatorics
- Cutting algebraic curves into pseudo-segments and applications
- Forbidden paths and cycles in ordered graphs and matrices
- Distinct distance estimates and low degree polynomial partitioning
- Semi-algebraic off-line range searching and biclique partitions in the plane
- ON THE SATELLITE CROSSING NUMBER CONJECTURE
- More unit distances in arbitrary norms
- Quantitative restrictions on crossing patterns
- Distinct distances in planar point sets with forbidden 4-point patterns
- On locally Gabriel geometric graphs
- A combinatorial problem on polynomials and rational functions
- General position subset selection in line arrangements
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Bounds on distinct and repeated dot product trees
- A crossing lemma for multigraphs
- Ghost chimneys
- Simple algorithms for partial point set pattern matching under rigid motion
- The crossing number of twisted graphs
- Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\)
This page was built for publication: Crossing Numbers and Hard Erdős Problems in Discrete Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354594)
