# Extremal Problems in Combinatorial Geometry

## Videos from BIRS Workshop 18w5058

, Carnegie Mellon University
- 11:07
On a topological version of Pach's overlap theorem
, Renyi Institute of Mathematics
- 11:41
Tight paths and matchings in convex geometric hypergraphs
, Renyi Institute of Mathematics
- 14:40
The Crossing Lemma for Multigraphs
, University of British Columbia
- 15:48
Unit distances in three dimensions
, University of Bristol
- 16:25
Geometric incidence type results in the plane over the prime field
, Alfred Renyi Institute of Mathematics
- 11:03
Theorems of Caratheodory and Tverberg with no dimension
, Johannes Kepler Universität
- 14:08
On iterated products sets with shifts and a partial inverse for the Szemeredi-Trotter Theorem
, Alfréd Rényi Institute of Mathematics
- 14:48
Coloring hypergraphs defined by pseudo-disks
, Ben-Gurion University
- 16:50
An improved bound on weak epsilon nets in the plane
, University of Birmingham
- 17:28
Lower Bounds for Searching Robots, some Faulty
, Hebrew University of Jerusalem
- 10:14
Hypertrees
, University of Michigan
- 11:15
Colorful coverings of polytopes -- the hidden topological truth behind different colorful phenomena
, IST Austria
- 11:53
The $\mathbb{Z}_2$-genus of Kuratowski minors
, University of Illinois at Chicago
- 09:29
An induced hypergraph Ramsey problem
, Renyi Institute, Budapest
- 10:05
Tiling the plane with noncongruent triangles
, London School of Economics and Political Science
- 11:01
Space quartics, ordinary planes and coplanar quadruples
, Institute of Science and Technology Austria
- 11:37
On intersection patterns of sets in the plane
, Georgia Tech
- 14:10
Constructive Polynomial Partitioning for Lines in R^3: Revisiting Depth Cycle Elimination
, Moscow Lomonosov State University
- 14:36
On certain problems related to the equation $xy =1$ in $\mathbb{F}_p$: continued fractions via (additive) combinatorics