1 paper
Danielle Blackwell, Christopher Hunt, Keyneé Johnson
In this paper we show that for each n, there exists a simple graph whose reliability polynomial has at least n inflection points.