An advanced application of the Minor Structure Theorem used to show the presence of large bipartite minors in sufficiently connected graphs. This application requires a more delicate apex vertex and vortex analysis, and we take this as an opportunity to derive a stronger form of the Minor Structure Theorem suitable for this task.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Minors in Large Connected Graphs

  • Zdeněk Dvořák

摘要

An advanced application of the Minor Structure Theorem used to show the presence of large bipartite minors in sufficiently connected graphs. This application requires a more delicate apex vertex and vortex analysis, and we take this as an opportunity to derive a stronger form of the Minor Structure Theorem suitable for this task.