umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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
Identifiers
URN: urn:nbn:se:umu:diva-52136ISI: 000188754300026OAI: oai:DiVA.org:umu-52136DiVA: diva2:497208
Available from: 2012-02-10 Created: 2012-02-10 Last updated: 2017-12-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

urn-nbn

Altmetric score

urn-nbn
Total: 49 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf