Research Problems in Discrete Geometry
From MaRDI portal
Publication:3156762
DOI10.1007/0-387-29929-7zbMath1086.52001OpenAlexW1539895965MaRDI QIDQ3156762
János Pach, W. O. J. Moser, 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 (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items
On the Erdős-Szekeres convex polygon problem, Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings, A generalization of Bang’s lemma, Coloring Axis-Parallel Rectangles, Bounding the Number of Edges of Matchstick Graphs, Covering convex hulls of compact convex sets with smaller homothetic copies, Exploring a Planet, Revisited, Still Spinning: The Moser Spindle at Sixty, Approximation of quadrilaterals by triangles with respect to minimal width, Lower Bounds on Lattice Covering Densities of Simplices, Nearly \(k\)-distance sets, Combinatorics. Abstracts from the workshop held January 1--7, 2023, The extensible no-three-in-line problem, Universal convex covering problems under translations and discrete rotations, An exponential bound for simultaneous embeddings of planar graphs, Improved Elekes-Szabó type estimates using proximity, Discrete isoperimetric problems in spaces of constant curvature, Classification of maps sending lines into translates of a curve, On the Optimal Conductivity of Packed Two-Dimensional Dispersed Composites, Unavoidable patterns in complete simple topological graphs, Quasiplanar graphs, string graphs, and the Erdős-Gallai problem, Distinct angle problems and variants, Local critical analysis of inequalities related to the sum of distances between \(n\) points on the unit hemisphere for \(n=4,5\), On the partition of plane sets into 6 subsets of small diameter, Estimations of covering functionals of simplices, Stars of empty simplices, On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves, Distinct Distances on Algebraic Curves in the Plane, Many disjoint edges in topological graphs, Covering functionals of Minkowski sums and direct sums of convex bodies, On a problem about covering lines by squares, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, Maximum Rectilinear Convex Subsets, On the number of discrete chains, Many disjoint edges in topological graphs, Aperture-angle and Hausdorff-approximation of convex figures, Traversing a set of points with a minimum number of turns, On the chromatic numbers of small-dimensional Euclidean spaces, Sharpness of Falconer's (d+1)/2 estimate, A lower bound for the equilateral number of normed spaces, Translative covering by unit squares, Piercing all translates of a set of axis-parallel rectangles, Unnamed Item, Unnamed Item, Optimal point sets determining few distinct triangles, Optimal packings of congruent circles on a square flat torus, On covering functionals of convex bodies, Disjoint edges in complete topological graphs, Avoiding Multiple Repetitions in Euclidean Spaces, Inserting one edge into a simple drawing is hard, Online unit covering in Euclidean space, Adjacent Crossings Do Matter, On Grids in Point-Line Arrangements in the Plane, Outerstring Graphs are $\chi$-Bounded, On Single-Distance Graphs on the Rational Points in Euclidean Spaces, On chromatic numbers of close-to-Kneser distance graphs, Lower bounds for the chromatic numbers of distance graphs with large girth, On empty convex polygons in a planar point set, On the number of plane geometric graphs, Minkowski Geometry—Some Concepts and Recent Developments, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), On computational complexity of length embeddability of graphs, Distance Ramsey numbers, Turán-type results for distance graphs in an infinitesimal plane layer, Convex polygons are cover-decomposable, The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields, CONTROLLING LIPSCHITZ FUNCTIONS, Independence numbers and chromatic numbers of the random subgraphs of some distance graphs, The odd-distance plane graph, Open sets avoiding integral distances, Many empty triangles have a common edge, On simplices in diameter graphs in \(\mathbb{R}^4\), Distinct Distances Between a Circle and a Generic Set, Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing, Small subgraphs and their extensions in a random distance graph, Prolific permutations and permuted packings: downsets containing many large patterns, From Tarski's Plank Problem to Simultaneous Approximation, On the number of occurrences of the \(k\)th smallest distance between points in convex position, On bipartite distinct distances in the plane, \(k\)-bisectors of finite planar sets, A generalisation of Sylvester's problem to higher dimensions, On the chromatic number of an infinitesimal plane layer, Distinct distances between a collinear set and an arbitrary set of points, Packings of equal disks in a square torus, A Sylvester-Gallai result for concurrent lines in the complex plane, Unnamed Item, Coloring curves that cross a fixed curve, k-Quasi-Planar Graphs, Approximations of convex bodies by measure-generated sets, New results on lower bounds for the number of (⩽ k)-facets, On embedding triconnected cubic graphs on point sets, The maximum number of halving lines and the rectilinear crossing number of for, A central approach to bound the number of crossings in a generalized configuration, Simultaneous Approximation of Polynomials, Additive groups with many unimodular elements, The simultaneous packing and covering constants in the plane, On the Size of Planarly Connected Crossing Graphs, No l Grid-Points in Spaces of Small Dimension, Odd wheels are not odd-distance graphs, On the number of dot product chains in finite fields and rings, \(L^p\) estimates for bilinear generalized Radon transforms in the plane, A branch-and-bound approach for estimating covering functionals of convex bodies, Straight line embeddings of cubic planar graphs with integer edge lengths, A generalization of the Fibonacci word fractal and the Fibonacci snowflake, On the Frankl–Rödl theorem, A note on distinct distance subsets, 4-holes in point sets, On the translative packing densities of tetrahedra and cuboctahedra, Upper bounds for the perimeter of plane convex bodies, On the Approximate Unit Distance Problem, Curve packing and modulus estimates, On 5-Gons and 5-Holes, On discrete values of bilinear forms, Empty convex hexagons in planar point sets, On the number of distances between the coordinates of points on modular hyperbolas, Seven mutually touching infinite cylinders, Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\), Unnamed Item, Nearly equal distances and Szemerédi's regularity lemma, On parallel packing and covering of squares and cubes, A note on maximally repeated sub-patterns of a point set, Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles, An extremal problem for integer sparse recovery, Hamiltonian Alternating Paths on Bicolored Double-Chains, A positive fraction mutually avoiding sets theorem, On the number of mutually touching cylinders. Is it 8?, On the Number of Ordinary Conics, A superlinear lower bound on the number of 5-holes, A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space, The Erdős-Szekeres Problem, A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\), Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles, Clique numbers of random subgraphs of some distance graphs, A note on distinct distances, Proper coloring of geometric hypergraphs, Discrete Geometry in Minkowski Spaces, On the Stretch Factor of Polygonal Chains, Small clique and large chromatic number, Covering a ball by smaller balls, Counterexamples to Borsuk's conjecture with large girth, Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm, 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, On large subgraphs of a distance graph which have small chromatic number, Saturated simple and \(k\)-simple topological graphs, Every 3-colorable graph has a faithful representation in the odd-distance graph, A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body, Nonconvex cases for carpenter's rulers, On the illumination of a class of convex bodies, Covering by homothets and illuminating convex bodies, Empty triangles in complete topological graphs, New upper bound for the chromatic number of a random subgraph of a distance graph, On Schur's conjecture in \(\mathbb R^4\), New lower bound for the chromatic number of a rational space with one and two forbidden distances, On the covering densities of quarter-convex disks, New lower bounds for the chromatic number of a space with forbidden isosceles triangles, Covering functionals of cones and double cones, Smallest universal covers for families of triangles, Configurations of non-crossing rays and related problems, Irregular polyomino tiling via integer programming with application in phased array antenna design, On large subgraphs with small chromatic numbers contained in distance graphs, On the chromatic numbers of integer and rational lattices, On triconnected and cubic plane graphs on given point sets, Empty monochromatic triangles, Visibility in the plane, Erdős-Szekeres without induction, The local optimality of the double lattice packing, Subtended angles, Areas of triangles and Beck's theorem in planes over finite fields, Unavoidable crossings in a thinnest plane covering with congruent convex disks, On a question of Erdős and Ulam, On the maximum number of translates in a point set, Covering the plane with translates of a triangle, On the diameter of separated point sets with many nearly equal distances, Maximum volume polytopes inscribed in the unit sphere, On the covering index of convex bodies, Lattice embeddings of planar point sets, Turán type results for distance graphs, On chromatic numbers of nearly Kneser distance graphs, On the distance and multidistance graph embeddability problem, On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces, Planar point sets with large minimum convex decompositions, Decomposition of multiple coverings into more parts, On lines and joints, Lines, circles, planes and spheres, On the perimeters of simple polygons contained in a plane convex body, Many collinear \(k\)-tuples with no \(k+1\) collinear points, Triangle-free geometric intersection graphs with large chromatic number, Monochromatic empty triangles in two-colored point sets, Small distances in convex polygons, Removing even crossings, A note on light geometric graphs, Combinatorial properties of double square tiles, New bounds for the distance Ramsey number, On weighted covering numbers and the Levi-Hadwiger conjecture, Triangle-free intersection graphs of line segments with large chromatic number, On Schur's conjecture in \(\mathbb{R}^{4}\), A pseudoline counterexample to the strong Dirac conjecture, On the perimeters of simple polygons contained in a disk, The number of unit distances is almost linear for most norms, A quantitative program for Hadwiger's covering conjecture, On the chromatic number of with an arbitrary norm, On \(k\)-gons and \(k\)-holes in point sets, Random runners are very lonely, A parallelogram tile fills the plane by translation in at most two distinct ways, New bounds on the maximum number of edges in \(k\)-quasi-planar graphs, On crossing numbers of geometric proximity graphs, On packing squares into a rectangle, Piercing translates and homothets of a convex body, On the number of ordinary circles determined by \(n\) points, On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\), The strong thirteen spheres problem, Combinatorial complexity bounds for arrangements of curves and spheres, An incidence theorem in higher dimensions, On the chromatic numbers of spheres in \(\mathbb R^n\), On the Hadwiger numbers of starlike disks, A bichromatic incidence bound and an application, Exact algorithms for the bottleneck Steiner tree problem, Covering the \(k\)-skeleton of the 3-dimensional unit cube by five balls, New bounds for the chromatic number of a space with forbidden isosceles triangles, Packing, covering and tiling in two-dimensional spaces, Every large point set contains many collinear points or an empty pentagon, Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\), Unfoldings of doubly covered polyhedra and applications to space-fillers, Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections, Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs, Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle, Extremal problems of circle packings on a sphere and irreducible contact graphs, Packing of odd squares revisited, On locally Gabriel geometric graphs, Disjoint edges in topological graphs and the tangled-thrackle conjecture, On convex geometric graphs with no \(k+1\) pairwise disjoint edges, On the number of similar instances of a pattern in a finite set, On the stability of some Erdős-Ko-Rado type results, Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance, The chromatic number of space with forbidden regular simplex, A note on the weak Dirac conjecture, Coloring translates and homothets of a convex body, A computational approach to Conway's thrackle conjecture, Subspace intersection graphs, Kadets-type theorems for partitions of a convex body, Almost empty monochromatic quadrilaterals in planar point sets, Proof of Schur's conjecture in \(\mathbb R^D\), On packing of rectangles in a rectangle, Computational geometric aspects of rhythm, melody, and voice-leading, Covering the \(k\)-skeleton of the 3-dimensional unit cube by six balls, Diameter graphs in \({\mathbb R}^4\), The maximum number of edges in geometric graphs with pairwise virtually avoiding edges, Hamiltonian paths in distance graphs, On the total perimeter of homothetic convex bodies in a convex container, On uniform boundedness of a rational distance set in the plane, Distinct distances in planar point sets with forbidden 4-point patterns, On the chromatic number of disjointness graphs of curves, Perfect packing of \(d\)-cubes, Functionals on the spaces of convex bodies, Independence numbers and chromatic numbers of some distance graphs, Improved bounds for Hadwiger's covering problem via thin-shell estimates, The density of fan-planar graphs, Covering the boundary of a convex body with its smaller homothetic copies, Online unit clustering and unit covering in higher dimensions, On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs, Parallel packing of triangles with squares, A Sylvester-Gallai theorem for cubic curves, A note on three Moser's problems and two Paulhus' lemmas, Computing the volume is difficult, Euclidean graph distance matrices of generalizations of the star graph, On the chromatic numbers of rational spaces, Repeated distances in space, Covering functionals of convex polytopes with few vertices, The complexity of cutting complexes, Elementary geometry on the integer lattice, Nondegenerate spheres in four dimensions, Tilings with noncongruent triangles, On large equilateral point-sets in normed spaces, A shape evolution model under affine transformations, Sparse locally-jammed disk packings, Proof of László Fejes Tóth's zone conjecture, On a Frankl-Wilson theorem, Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus, Tropical combinatorial Nullstellensatz and sparse polynomials, Large simplices determined by finite point sets, Determining all universal tilers, On Hamiltonian alternating cycles and paths, Colored spanning graphs for set visualization, On sets defining few ordinary circles, Chromatic numbers of spaces with forbidden monochromatic triangles, Large convex holes in random point sets, Point sets with small integer coordinates and no large convex polygons, Efficient packings of unit squares in a large square, On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points, On the degenerate crossing number, Distance graphs with large chromatic number and without large cliques, Covering lattice points by subspaces and counting point-hyperplane incidences, On the number of points with pairwise integral distances on a circle, Beck's theorem for plane curves, Hirzebruch-type inequalities viewed as tools in combinatorics, On a Heilbronn-type problem, Packing 13 circles in an equilateral triangle, On the upper bound on the average distance from the Fermat-Weber center of a convex body, There are integral heptagons, no three points on a line, no four on a circle, Long alternating paths in bicolored point sets, On the number of order types in integer grids of small size, Flips in planar graphs, On lattice coverings by simplices, On the sum of distances along a circle, A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture, Moments of the maximal number of empty simplices of a random point set, Homotheties and incidences, On Borsuk's conjecture for two-distance sets, On packing \(\mathbb R^3\) with thin tori, On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups, On invariant line arrangements, Empty monochromatic simplices, An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\), Trapezoids and deltoids in wide planar point sets, Covering a set with homothets of a convex body, Covering functionals of convex polytopes, Multiple coverings with closed polygons, Distance graphs with large chromatic numbers and small clique numbers, A quantitative variant of the multi-colored Motzkin-Rabin theorem, Monochromatic simplices of any volume, A note on the number of different inner products generated by a finite set of vectors, On Wegner's inequality for axis-parallel rectangles, Triangle areas in line arrangements, One problem on geometric Ramsey numbers, Enumeration of irreducible contact graphs on the sphere, Pessimal packing shapes, On covering problems of Rado, Invisible runners in finite fields, Obstacle numbers of graphs, On a relation between packing and covering densities of convex bodies, On grids in point-line arrangements in the plane, Coloring axis-parallel rectangles, On the minimum number of ordinary conics, 3-symmetric and 3-decomposable geometric drawings of \(K_n\), Improved upper bounds on the reflexivity of point sets, Partition bounded sets into sets having smaller diameters, Unit distance graphs and algebraic integers, Planar point sets determine many pairwise crossing segments, Isoperimetric polygons of maximum width, On edges crossing few other edges in simple topological complete graphs, Circumscribed polygons of small area, Shortest closed curve to inspect a sphere, Simple polygons of maximum perimeter contained in a unit disk, Integral point sets over \(\mathbb Z_n^m\), On the packing of fourteen congruent spheres in a cube, New results on lower bounds for the number of \((\leq k)\)-facets, Integral point sets in higher dimensional affine spaces over finite fields, Extremal problems on triangle areas in two and three dimensions, More on an Erdős-Szekeres-type problem for interior points, On polygons enclosing point sets. II, Techniques and results on approximation algorithms for packing circles, Blocking numbers and fixing numbers of convex bodies, Kissing numbers for balls with varying radii, Increasing the minimum distance of a set of points, Piercing all translates of a set of axis-parallel rectangles
