2 citations · 2 across the 1 of their papers we have counts for
4 papers
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Åukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity
András Máthé, Jonathan A. Noel, Oleg Pikhurko
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a part…
A note on extremal constructions for the ErdÅs--Rademacher problem
Xizhi Liu, Oleg Pikhurko
For given positive integers , and , the famous Erd\H os--Rademacher problem asks for the minimum number of -cliques in a graph with vertices a…
Finite Hypergraph Families with Rich Extremal Turán Constructions via Mixing Patterns
Xizhi Liu, Oleg Pikhurko
We prove that, for any finite set of minimal -graph patterns, there is a finite family of forbidden -graphs such that the extremal Turán constructions for $\mat…