A note on a counting problem arising in percolation theory

Rafi Levy, Eli Shamir*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We investigate an esoteric enumeration problem on graphs which arises from a physical model related to the continuum percolation theory. It counts signed objects, but surprisingly, we are able to find an equivalent count of positive signs only, namely, restricted acyclic orientations. This reduces the counting effort, but shows on the other hand that it is a #P-complete problem.

Original languageEnglish
Pages (from-to)361-365
Number of pages5
JournalDiscrete Mathematics
Volume114
Issue number1-3
DOIs
StatePublished - 28 Apr 1993

Fingerprint

Dive into the research topics of 'A note on a counting problem arising in percolation theory'. Together they form a unique fingerprint.

Cite this