Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson Seymour (1983) proved that every tree~$T$, class of graphs do not contain $T$ as has bounded path-width. For pivot-minor relation, rank-width take over from tree-width As such, it is natural to examine if rank-width. We first prove this statement false whenever tree caterpilla...