2020
Jan
27

# Combinatorics: Chaya Keller (Ariel)

10:00am to 12:00pm

## Location:

C-400, CS building

**Title:**The epsilon-t-net problem

**Abstract:**

In this talk we study a natural generalization of the classical \eps-net problem (Haussler-Welzl 1987), which we call 'the \eps-t-net problem': Given a hypergraph on n vertices and parameters t and \eps , find a minimum-sized family S of t-element subsets of vertices such that each hyperedge of size at least \eps n contains a set in S. When t=1, this corresponds to the \eps-net problem.