Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs

Emile Anand

We prove that every graph of rankwidth at least $72r$ contains an induced subgraph whose minimum balanced cutrank is at least $r$, which implies a vertex subset where every balance…