The Growth Constant of Odd Cutsets in High Dimensions

Ohad Noy Feldheim, Yinon Spinka

Research output: Contribution to journalArticlepeer-review


A cutset is a non-empty finite subset of Zd which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of Zd. Peled [18] suggested that the number of odd cutsets which contain the origin and have n boundary edges may be of order e Θ(n/d) as d → ∞, much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel [15] to be of order d Θ(n/d). In this paper, we verify this by showing that the number of such odd cutsets is (2+o(1))n/2d.

Original languageAmerican English
Pages (from-to)208-227
Number of pages20
JournalCombinatorics Probability and Computing
Issue number2
StatePublished - 1 Mar 2018
Externally publishedYes

Bibliographical note

Funding Information:
Research of Y.S. supported by Israeli Science Foundation grant 861/15, the European Research Council starting grant 678520 (LocalOrder), and the Adams Fellowship Program of the Israel Academy of Sciences and Humanities.

Publisher Copyright:
© 2017 Cambridge University Press.


Dive into the research topics of 'The Growth Constant of Odd Cutsets in High Dimensions'. Together they form a unique fingerprint.

Cite this