Walks, Paths and Connectivity · Challenge problem

What is the smallest $m$ such that EVERY simple graph on $10$ vertices with $m$ edges is connected?