Induced trees in triangle-free graphs

We prove that every connected triangle-free graph on n vertices contains an induced tree on e x p ( c log n ) vertices, where c is a positive constant. The best known upper bound is ( 2 + o ( 1 ) ) n . This partially answers questions of Erdős, Saks, and Sós and of Pultr.