Combinatorica
Eliminating Cycles in the Discrete Torus
Algorithmica
A Counterexample to Strong Parallel Repetition
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Let m 2 be an integer, let C2m denote the cycle of length 2m on the set of vertices [−m, m) = {−m, −m + 1,. . ., m − 2, m − 1}, and let G = G(m, d) denote the graph on the set of vertices [−m, m)d, in which two vertices are adjacent if and only if they are adjacent in C2m in one coordinate, and equal in all others. This graph can be viewed as the graph of the d-dimensional torus. We prove that one can delete a fraction of at most $O(\frac{\log d}{m})$ of the vertices of G so that no topologically non-trivial cycles remain. This is tight up to the logd factor and improves earlier estimates by various researchers.