A Connectivity Lemma

The purpose of this note is to show how a lemma that is implicit in the work of Barnette can be used for proving lower bounds on the connectivity of certain graphs. The main result is that connectivity equals minimal degree in basic word graphs of antimatroids. This was known before only for the special case of graphs of linear extensions, and the proof was much more complicated.