Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Ori, all I can say in a few words re: motivation is that this graph parameter bounds another one that I'm actually interested in. I thought about it a bit more, and decided that you're right, $\alpha=1$ is the right answer. Rather than finding disjoint pairs of vertices, we can use all the pairs since most pairs are independent -- extended Janson inequality makes it work...
