scientific article; zbMATH DE number 1017008
From MaRDI portal
Publication:4339095
arrangementsdensitygraph theoryconvexitycombinatorial geometryconvex setscoveringspackingspolygonal approximations
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Recommendations
Cited in
(only showing first 100 items - show all)- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
- New results on the coarseness of bicolored point sets
- The visible perimeter of an arrangement of disks
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Opaque sets
- A combinatorial theorem on labeling squares with points and its application
- On the combinatorics of projective mappings
- Noncrossing Hamiltonian paths in geometric graphs
- Covering a rectangle with six and seven circles
- On the number of edges in induced subgraphs of a special distance graph
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Geometry and combinatorics of the cutting angle method
- Crossing patterns of segments
- A non-linear lower bound for planar epsilon-nets
- Constant-factor approximation for TSP with disks
- Discrete harmonic functions on infinite penny graphs
- Extremal problems on triangle areas in two and three dimensions
- Packing, covering and tiling in two-dimensional spaces
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
- Configurations between geometry and combinatorics.
- Spectral partitioning works: planar graphs and finite element meshes
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- Paul Erdős, 1913-1996
- Relative (p, )-approximations in geometry
- New Turán type bounds for Johnson graphs
- Extremal problems for geometric hypergraphs
- Theory and application of width bounded geometric separators
- On some monotone path problems in line arrangements
- A tight bound for the number of edges of matchstick graphs
- scientific article; zbMATH DE number 848093 (Why is no real title available?)
- On the approximability of covering points by lines and related problems
- Centerpoints and Tverberg's technique
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices
- On the maximum number of touching pairs in a finite packing of translates of a convex body
- On the number of tangencies among 1-intersecting \(x\)-monotone curves
- Drawing outerplanar graphs using three edge lengths
- Note on geometric graphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Piercing translates and homothets of a convex body
- Separating circles on the sphere by polygonal tilings
- A center transversal theorem for hyperplanes and applications to graph drawing
- A product inequality for extreme distances
- A semi-algebraic version of Zarankiewicz's problem
- On distinct sums and distinct distances.
- scientific article; zbMATH DE number 7561580 (Why is no real title available?)
- Problems related to a de Bruijn-Erdös theorem
- Remarks on superstrings, fractal gravity, Nagasawa's diffusion and Cantorian spacetime
- Radial points in the plane
- Discrete geometry on colored point sets in the plane -- a survey
- From harmonic analysis to arithmetic combinatorics
- Approximating set multi-covers
- On uniformly distributed dilates of finite integer sequences
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
- A new proof of Vázsonyi's conjecture
- An optimal generalization of the colorful Carathéodory theorem
- Borsuk's problem and the chromatic numbers of metric spaces
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
- Gallai colorings of non-complete graphs
- On the chromatic number of some geometric type Kneser graphs
- Distinct distances in planar point sets with forbidden 4-point patterns
- A note on a problem of Erdős on right angles
- Disjoint edges in topological graphs and the tangled-thrackle conjecture
- On the number of similar instances of a pattern in a finite set
- A combinatorial problem on polynomials and rational functions
- Minimum vertex cover in ball graphs through local search
- Ball and spindle convexity with respect to a convex body
- Combinatorics and Finite Geometry
- Piercing all translates of a set of axis-parallel rectangles
- Connecting Cycles for Concentric Circles
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Outerplanar thrackles
- Bichromatic lines with few points
- Erdös distance problem in vector spaces over finite fields
- Large unavoidable subtournaments
- Chromatic numbers of spaces with forbidden monochromatic triangles
- On triangle cover contact graphs
- On grids in point-line arrangements in the plane
- Antipodality properties of finite sets in Euclidean space
- Independent set of intersection graphs of convex objects in 2D
- Tight lower bounds for the size of epsilon-nets
- Realizability of graphs as triangle cover contact graphs
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Sets with few distinct distances do not have heavy lines
- A new lower bound for the bipartite crossing number with applications
- Separable partitions
- Can one define geometry today?
- Counting and Cutting Rich Lenses in Arrangements of Circles
- Centering koebe polyhedra via Möbius transformations
- Incidences between points and generalized spheres over finite fields and related problems
- Quantitative combinatorial geometry for continuous parameters
- Periodicity of identifying codes in strips
- Estimate of the number of edges in special subgraphs of a distance graph
- scientific article; zbMATH DE number 1061188 (Why is no real title available?)
- The packing density of the \(n\)-dimensional cross-polytope
- 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
- Almost similar configurations
- Constrained versions of Sauer's Lemma
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- scientific article; zbMATH DE number 3388146 (Why is no real title available?)
- Flips in planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339095)