4 problems

Orlin's converse conjecture. Every equistable graph is a general partition graph.

A graph is strongly equistable if, for every nonempty subset $T$ that is not a maximal stable set and every $\gamma\leq 1$, it admits positive vertex weights giving every maximal s…

A strong clique in a graph is a clique that meets every maximal stable set. A graph is equistable if it admits positive vertex weights characterizing its maximal stable sets by tot…

A graph $G=(V,E)$ is equistable if there is a function assigning positive weights to the vertices such that a subset of vertices is a maximal stable set exactly when its total weig…