The Clarkson–Shor Technique Revisited and Extended

This work provides an alternative simpler and more general version of the Clarkson-Shor probabilistic technique and uses it to obtain in addition several extensions and new combi- natorial bounds.

Abstract

We provide an alternative, simpler and more general derivation of the Clarkson–Shor probabilistic technique [7] and use it to obtain several extensions and new combinatorial bounds.