Minors in expanding graphs

Simple item page
dc.creatorKrivelevich, Michael
dc.creatorSudakov, Benny
dc.date2007-07-01
dc.date.accessioned2026-07-07T08:13:18Z
dc.date.available2026-07-07T08:13:18Z
dc.descriptionExtending 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.
dc.identifierhttps://arxiv.org/abs/0707.0133
dc.identifierhttp://arxiv.org/abs/0707.0133
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132756
dc.subjectCombinatorics
dc.titleMinors in expanding graphs
dc.typetext

Files

Collections

arXiv