So let's apply a branch-and-cut for the max stable set problem. Let's start with this problem. So if you solve with just the arc inequalities we end up with a solution with value 1/2 for each node. Then we identify ten cliques of three arcs each. And after having added those clique inequalities we get a new solution with value 2/3, 1/3 and so on.