A minor of a minor is a minor
ProvedRobertsonSeymour1986.GM5.isMinor_transgraph-minorsten-challenges
The minor relation is transitive: if is a minor of and is a minor of , then is a minor of :
In the branch-set model, if models in and models in , then models in . Transitivity is used throughout Graph Minors V, for instance to pass from 'no minor' to 'no grid minor' when is a minor of a grid.
Formalization Note Minors are IsMinor (branch-set model) on arbitrary vertex types.
Preamble
import Mathlib import Definitions.Def_RobertsonSeymour1986_GM5_IsMinor
Formal statement
namespace RobertsonSeymour1986.GM5
theorem isMinor_trans {W U V : Type} {H : SimpleGraph W} {K : SimpleGraph U} {G : SimpleGraph V}
(hHK : IsMinor H K) (hKG : IsMinor K G) : IsMinor H G := by sorry
end RobertsonSeymour1986.GM5Source
Robertson–Seymour, Graph Minors. V. Excluding a Planar Graph, J. Combin. Theory Ser. B 41 (1986), Sect. 1, p. 92 (definition of minor: 'obtained by contraction from a subgraph'); transitivity of the minor relation is implicit there and standard.