2 search results - page 1 / 1 » The Brunn--Minkowski Inequality and Nontrivial Cycles in the... |
SIAMDM
2010
12 years 11 months ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
ALGORITHMICA
2008
13 years 4 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...