2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/132756Extending several previous results we obtained nearly tight estimates on the maximum size of a clique-minor in various classes of expanding graphs. These results can be used to show that graphs without short cycles and other H-free graphs contain large clique-minors, resolving some open questions in this area.Combinatoricstext