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

Branch target buffers (BTBs) are caches in which branch information is stored that is used for branch prediction by the fetch stage of the instruction pipeline. A typical BTB requires a few kbyte of storage which makes it rather large and, because it is accessed every cycle, rather power consuming. Partial resolution has in the past been proposed to reduce the size of a BTB. A partial resolutio...