Change search
ReferencesLink to record
Permanent link

Direct link
Complete minors in cubic graphs with few short cycles and random cubic graphs
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2004 (English)In: Ars combinatoria, ISSN 0381-7032, Vol. 70, 289-295 p.Article in journal (Refereed) Published
Abstract [en]

We first prove that for any fixed kappa a cubic graph with few short cycles contains a K-kappa-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this theorem to show that for any fixed k a random cubic graph contains a Kk-minor asymptotically almost surely.

Place, publisher, year, edition, pages
2004. Vol. 70, 289-295 p.
Keyword [en]
extremal function
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-52136ISI: 000188754300026OAI: diva2:497208
Available from: 2012-02-10 Created: 2012-02-10 Last updated: 2012-06-07Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Ars combinatoria
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link