Graphs without large K_2,n-minors

2017/02/05 by Ding, Guoli
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1702.01355

Abstract

The purpose of this paper is to characterize graphs that do not have a large K_2,n-minor. As corollaries, it is proved that, for any given positive integer n, every sufficiently large 3-connected graph with minimum degree at least six, every 4-connected graph with a vertex of sufficiently high degree, and every sufficiently large 5-connected graph must have a K_2,n-minor.

Related

• K₆ minors in 6-connected graphs of bounded tree-width
• K₆ minors in large 6-connected graphs
• A characterization of K_2,4-minor-free graphs
• Bipartite graphs with no K₆ minor
• A note on highly connected K_2,ℓ-minor free graphs