Almost isoperimetric subsets of the discrete cube
Combinatorics
2013-11-28 v2
Abstract
We show that a set with edge-boundary of size at most can be made into a subcube by at most additions and deletions, provided is less than an absolute constant. We deduce that if has size for some , and cannot be made into a subcube by fewer than additions and deletions, then its edge-boundary has size at least , provided is less than an absolute constant. This is sharp whenever for some .
Cite
@article{arxiv.1310.8179,
title = {Almost isoperimetric subsets of the discrete cube},
author = {David Ellis},
journal= {arXiv preprint arXiv:1310.8179},
year = {2013}
}
Comments
Typos corrected in Conjectures 12 and 13