Research Problems in Discrete Geometry

DOI10.1007/0-387-29929-7MaRDI QIDQ3156762zbMATH OpenOpenAlexFDO

Authors W. O. J. Moser, János Pach, Peter Brass

Publication date 11 January 2005

Full work available at URL http://www.math.nyu.edu/~pach/research_problems.html

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

Problems in Discrete Geometry
scientific article; zbMATH DE number 3453507
scientific article; zbMATH DE number 480238
Some numerical problems in discrete geometry
Discrete and computational geometry
scientific article; zbMATH DE number 1013961
Discrete geometry
scientific article; zbMATH DE number 1421267
Extremal problems in discrete geometry

Cited in

(only showing first 100 items - show all)

On the Optimal Conductivity of Packed Two-Dimensional Dispersed Composites
A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture
On computational complexity of length embeddability of graphs
New bounds for the distance Ramsey number
Covering functionals of cones and double cones
Functionals on the spaces of convex bodies
On the number of order types in integer grids of small size
On covering problems of Rado
Coloring translates and homothets of a convex body
Musings on Discrete Geometry and ``20 years of Discrete \& Computational Geometry
The density of fan-planar graphs
On large subgraphs of a distance graph which have small chromatic number
A central approach to bound the number of crossings in a generalized configuration
New results on lower bounds for the number of (⩽ k)-facets
The maximum number of halving lines and the rectilinear crossing number of for
Geometric Etudes in Combinatorial Mathematics
Triangle-free geometric intersection graphs with large chromatic number
On chromatic numbers of close-to-Kneser distance graphs
Triangle-free intersection graphs of line segments with large chromatic number
Independence numbers and chromatic numbers of some distance graphs
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
On the stability of some Erdős-Ko-Rado type results
A note on the number of different inner products generated by a finite set of vectors
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
Lower Bounds on Lattice Covering Densities of Simplices
Controlling Lipschitz functions
Smallest universal covers for families of triangles
On invariant line arrangements
Moments of the maximal number of empty simplices of a random point set
On the number of distances between the coordinates of points on modular hyperbolas
Visibility in the plane
Combinatorial properties of double square tiles
On lattice coverings by simplices
Optimal point sets determining few distinct triangles
Empty monochromatic simplices
On the number of ordinary conics
A quantitative program for Hadwiger's covering conjecture
On the chromatic numbers of spheres in \(\mathbb R^n\)
A pseudoline counterexample to the strong Dirac conjecture
A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
On the chromatic number of an infinitesimal plane layer
The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields
Some problems, I care most
Proper coloring of geometric hypergraphs
Beck's theorem for plane curves
Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
Volumetric discrete geometry
On a problem about covering lines by squares
A note on the weak Dirac conjecture
Curve packing and modulus estimates
Topics in modern combinatorics. 23rd Brazilian mathematics colloquium.
Areas of triangles and Beck's theorem in planes over finite fields
Local critical analysis of inequalities related to the sum of distances between \(n\) points on the unit hemisphere for \(n=4,5\)
On the diameter of separated point sets with many nearly equal distances
\(L^p\) estimates for bilinear generalized Radon transforms in the plane
Enumeration of irreducible contact graphs on the sphere
Covering the plane with translates of a triangle
Isoperimetric polygons of maximum width
On the Frankl-Rödl theorem
Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)
Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
Trapezoids and deltoids in wide planar point sets
Covering functionals of convex polytopes
On Wegner's inequality for axis-parallel rectangles
Monochromatic simplices of any volume
New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
A new approach to the upper bound on the average distance from the Fermat-Weber center of a convex body
Piercing all translates of a set of axis-parallel rectangles
Obstacle numbers of graphs
A note on distinct distances
New lower bounds for the chromatic number of a space with forbidden isosceles triangles
Exploring discrete geometry
Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
Empty triangles in complete topological graphs
Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
Packing 13 circles in an equilateral triangle
Unavoidable crossings in a thinnest plane covering with congruent convex disks
On the partition of plane sets into 6 subsets of small diameter
Covering the boundary of a convex body with its smaller homothetic copies
Configurations of non-crossing rays and related problems
Many empty triangles have a common edge
Efficient packings of unit squares in a large square
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
Bounding the number of edges of matchstick graphs
On the covering index of convex bodies
Research problems
Removing even crossings
Covering functionals of convex polytopes with few vertices
On parallel packing and covering of squares and cubes
On a Frankl-Wilson theorem
On Schur's conjecture in \(\mathbb{R}^{4}\)
Small subgraphs and their extensions in a random distance graph
On the sum of distances along a circle
Random runners are very lonely
Subspace intersection graphs
Kadets-type theorems for partitions of a convex body
Selected open problems in discrete geometry and optimization
Every 3-colorable graph has a faithful representation in the odd-distance graph
Nonconvex cases for carpenter's rulers
On the number of discrete chains

This page was built for publication: Research Problems in Discrete Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156762)