Minors in expanding graphs
Combinatorics
2007-07-03 v1
Abstract
Extending 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.
Keywords
Cite
@article{arxiv.0707.0133,
title = {Minors in expanding graphs},
author = {Michael Krivelevich and Benny Sudakov},
journal= {arXiv preprint arXiv:0707.0133},
year = {2007}
}