A topological minor is a minor
ProvedTenChallenges.minor_of_topologicalMinorgraph-minorsten-challengestopological-minor
If a graph contains a subdivision of a graph , then is a minor of :
Each branch vertex together with suitable interior vertices of its incident subdivided edges forms a connected branch set; contracting these recovers . This is the easy comparison between the two containment relations, used to pass from Kuratowski's theorem (excluded subdivisions) to Wagner's theorem (excluded minors).
Formalization Note Subdivisions are SimpleGraph.TopologicalMinor and minors are SimpleGraph.Minor (branch-set model), for arbitrary vertex types.
Preamble
import Definitions.Def_TenChallenges_Minor import Definitions.Def_TenChallenges_TopologicalMinor
Formal statement
namespace TenChallenges
theorem minor_of_topologicalMinor {W V : Type} {H : SimpleGraph W} {G : SimpleGraph V}
(T : SimpleGraph.TopologicalMinor H G) : Nonempty (SimpleGraph.Minor H G) := by sorry
end TenChallengesSource
Standard; see e.g. Diestel, Graph Theory, Sect. 1.7 (every topological minor is a minor). Used in deriving Wagner's theorem (Math. Ann. 114 (1937)) from Kuratowski's theorem (Fund. Math. 15 (1930)).