K-Walks Of Graphs

In [2] Bill Jackson and N.C. Wormald presented the following conjecture:Let j>1,k>2,and G is j - connected,K1,jk + 1-free graph,then G contains k - walks. In this paper we show it doesn't hold for j>2 and j 5,6,7. Also we prove that,if G is 2 - connected and ,then G contains k - trees,and the condition is the best possible. Thus we obtain that,in the same condition,G contains k - walks.