Extremal problems for geometric hypergraphs
From MaRDI portal
Publication:6487430
DOI10.1007/BFB0009486zbMath1512.68413MaRDI QIDQ6487430
Publication date: 25 January 2023
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial distinction between the Euclidean and projective planes
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Points and triangles in the plane and halving planes in space
- An upper bound on the number of planar \(K\)-sets
- The colored Tverberg's problem and complexes of injective functions
- On counting triangulations in \(d\) dimensions
- Some geometric applications of Dilworth's theorem
- Counting triangle crossings and halving planes
- On extremal problems of graphs and generalized graphs
- On the number of halving planes
- A Separator Theorem for Planar Graphs
- Crossing-Free Subgraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On the Number of Incidences Between Points and Curves
This page was built for publication: Extremal problems for geometric hypergraphs