We show that a maximal triangle-free graph on n vertices with minimum
degree delta contains an independent set of 3delta - n vertices which
have identical neighborhoods. This yields a simple proof that if the b
inding number of a graph is at least 3/2 then it has a triangle. This
was conjectured originally by Woodall. (C) 1993 John Wiley & Sons, Inc
.