cut_rank (356B)
1 # Cut rank 2 3 The [cut_rank] of a subset of vertices U in a [graph] with vertex set V is the [rank] of the [adjacency_matrix] between U and the complement V\U 4 5 Defined in [bojanczyk2024rank] 6 7 Bounding the cutrank amounts to bounding the [matrix_diversity] of the [adjacency_matrix], cf [bojanczyk2025low] Lemma 2.1 8 9 See also: [rankwidth] 10 11 Up: [graph_theory]