Given a graph $G=(V,E)$, a spanning forest $F$ is $\alpha$ thin with respect to $G$ if for any cut $(S,V-S)$, the number of edges of $F$ in the cut is at most $\alpha$ fraction of the number of edges of $G$. In this talk we will show that any $k$-edge connected graph $G$ has a $C/k$-thin forest with linear number of edges.