13 citations · 19 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010★ 1 cited
Maker Can Construct a Sparse Graph on a Small Board
Heidi Gebauer
We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given tar…
math.CO2010★ 2 cited
The Local Lemma is asymptotically tight for SAT
Heidi Gebauer, Tibor Szabo, Gabor Tardos
The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptot…