Birs- 22w5009: Extremal Combinatorics and Geometry
-
Title: The Integrality Gap for the Santa Claus Problem
Speaker:
Link:
-
Title: Extremal graphs without exponentially-small bicliques
Speaker:
Link:
-
Title: On random polytopes, epsilon-net and center points.
Speaker:
Link:
-
Title: Sparse colorful results in combinatorial geometry
Speaker:
Link:
-
Title: Deletion codes and regularity
Speaker:
Link:
-
Title: Coprime matchings and lonely runners
Speaker:
Link:
-
Title: The Kahn-Kalai conjecture and Sunflowers in set systems with bounded VC-dimension
Speaker:
Link:
-
Title: Partitioning cubic graphs into two isomorphic linear forests
Speaker:
Link:
-
Title: Spencer's theorem in nearly input-sparsity time
Speaker:
Link:
-
Title: Coloring ordered graphs with excluded induced ordered matchings
Speaker:
Link:
-
Title: Pairwise intersecting convex sets and cylinders in R^3
Speaker:
Link:
-
Title: Hypergraph Matchings Avoiding Forbidden Submatchings
Speaker:
Link:
-
Title: The Intersection Density of Permutation Groups
Speaker:
Link:
-
Title: Minimum Weight Euclidean $(1+\varepsilon)$-Spanners
Speaker:
Link:
-
Title: What kind of hypergraphs can be extremal for a hypergraph Turan problem?
Speaker:
Link:
-
Title: Bounding and computing obstacle numbers of graphs
Speaker:
Link:
-
Title: Combinatorics of plane intervals
Speaker:
Link: