
376 Combinatorics of Permutations, Second Edition
7
7
L
R
2
L
2
R
1
L
1
R
00
R
R
5
5
6
6
L
L
R
R
4
L
4
R
3
3
L
L
FIGURE 9.12
The breakpoint graph of B(312 231).
However, the following is an example of a super-bad permutation.
Example 9.36
[200] It can be computationally verified [200] that the 10-permutation
85210741963
is super-bad.
DEFINITION 9.37 Let p and q be permutations so that p is at least as
long as q,andletC be an odd cycle in B(p). We say that C is homeomorphic
to B(q) if there is a cyclic-order preserving function π from the vertex set of
B(q) into the vertex set of B(p) so that π(B(q)) = C.
For example, if q is a permutation that consists of a single cycle, then the
cycle ...