J. Matoušek

activity

19982019

most citedLower bounds for weak epsilon-nets and stair-convexity

44 citations · 279 across the 33 of their papers we have counts for

collaborators

Showing 2012 · math.COShow all

2 papers · 2 filters

math.CO2012

Simplifying inclusion-exclusion formulas

Xavier Goaoc, Jiří Matoušek, Pavel Paták +2

Let $F = {F_{1}, F_{2}, \dots, F_{n}}$ be a family of $n$ sets on a ground set $S$ , such as a family of balls in $R^{d}$ . For every finite measure $μ$ on $S$ , such that t…

math.CO2012★ 25 cited

Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1

Boris Bukh, Jiri Matousek

A classical and widely used lemma of Erdos and Szekeres asserts that for every n there exists N such that every N-term sequence a of real numbers contains an n-term increasing subs…