We then rely on recent results of Krivlevich [1]} showing that locally sparse graphs with some additional properties contain large expanding subgraphs. Similar ideas are also used to prove the existence of large minors with linear treewidth in the noisy path.
