n:
. r
n 
(G:({s:(n List)| ||s|| = k 
& (x,y:||s||. x < y s[x] < s[y]) }
||L||). 
c:||L||, f:(L[c]n). increasing(f;L[c]) & (s:L[c] List. ||s|| = k (x,y:||s||. x < y s[x] < s[y]) G(map(f;s)) = c))
is mentioned
In prior sections: graph 1 2