2009/06/15 by Jan-Oliver Fröhlich, Fröhlich, Jan-Oliver, Theodor Müller +1
Computer Science · Mathematics · #05C83 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Interconnection Networks and Systems #math.CO #msc:05C83
paper · pdf · doi:10.48550/arxiv.0906.2568
8 pages
arxiv created 2009/06/15 · openalex publication_date 2009/06/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
The recent paper "Linear Connectivity Forces Large Complete Bipartite Minors" by Boehme et al. relies on a structure theorem for graphs with no H-minor. The sketch provided of how to deduce this theorem from the work of Robertson and Seymour appears to be incomplete. To fill this gap, we modify the main proof of that paper to work with a mere restatement of Robertson and Seymour's original results instead.