  We prove that among all graphs of order n, the path uniquely minimises the
average order of its connected induced subgraphs. This confirms a conjecture of
Kroeker, Mol and Oellermann, and generalises a classical result of Jamison for
trees, as well as giving a new, shorter proof of the latter. While this paper
was being prepared, a different proof was given by Andrew Vince.
