The min-term graph-property sensitivity conjecture

Let $f$ be a Boolean graph property on the ${n \choose 2}$ possible edges. A min-term graph property is a graph property of the type defined in Chakraborty's work, and $f$ is non-trivial when it is not constant. Min-term sensitivity conjecture. The sensitivity satisfies

$$s(f)\geq n-1.$$

This is proposed in the source as a weaker form of Turan's conjecture, restricted to non-trivial min-term graph properties; its status is not otherwise resolved in the supplied text.