We study the cycle structure of 1-tough, triangle-free graphs. In part
icular, we prove that every such graph on n greater than or equal to 3
vertices with minimum degree delta greater than or equal to 1/4(n + 2
) has a 2-factor. We also show this is best possible by exhibiting an
infinite class of 1-tough, triangle-free graphs having delta = 1/4(n 1) and no 2-factor. (C) 1996 John Wiley & Sons, Inc.