Results 1 -
1 of
1
Meander Graphs
"... We consider a meander M = [A: B] to be formed from two sets A and B of n nonintersecting arcs, lying above and respectively below a horizontal line, which join to form a single closed loop. We prove that the set of meanders is connected under appropriate pairs of balanced local moves, one operating ..."
Abstract
- Add to MetaCart
We consider a meander M = [A: B] to be formed from two sets A and B of n nonintersecting arcs, lying above and respectively below a horizontal line, which join to form a single closed loop. We prove that the set of meanders is connected under appropriate pairs of balanced local moves, one operating on A and the other on B. We also prove that the subset of meanders with a fixed B is connected under a suitable local move operating on an appropriately defined meandric triple in A. We provide diameter bounds under such moves, tight up to a (worst case) factor of two. 1

