Abstract
A cutset is a non-empty finite subset of which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of . Peled suggested that the number of odd cutsets which contain the origin and have boundary edges may be of order as , much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel to be of order . In this paper, we verify this by showing that the number of such odd cutsets is .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.