Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CPC

2016

2016

This paper addresses the following question for a given graph H: what is the minimum number f(H) such that every graph with average degree at least f(H) contains H as a minor? Due to connections with Hadwiger’s Conjecture, this question has been studied in depth when H is a complete graph. Kostochka and Thomason independently proved that f(Kt) = ct √ ln t. More generally, Myers and Thomason determined f(H) when H has a super-linear number of edges. We focus on the case when H has a linear number of edges. Our main result, which complements the result of Myers and Thomason, states that if H has t vertices and average degree d at least some absolute constant, then f(H) 3.895 √ ln d t. Furthermore, motivated by the case when H has small average degree, we prove that if H has t vertices and q edges, then f(H) t + 6.291q (where the coeﬃcient of 1 in the t term is best possible). 2010 Mathematics Subject Classiﬁcation. 05C83, 05C35, 05D40.

Related Content

Added |
01 Apr 2016 |

Updated |
01 Apr 2016 |

Type |
Journal |

Year |
2016 |

Where |
CPC |

Authors |
Bruce A. Reed, David R. Wood |

Comments (0)