Unavoidable pivot-minors in graphs of large rank-depth

Jungho Ahn, Kevin Hendrey, O-joung Kwon +1

Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-d…