In this paper, we prove that there exist triangle-free graphs with arb
itrarily large toughness, thereby settling a longstanding open questio
n. We also explore the problem of whether there exists a t-tough, n/(t
+ 1)-regular, triangle-free graph on n vertices for various values of
t, and provide a relatively complete answer for small values of t. (C
) 1995 Academic Press, Inc.