# Gliders in Kneser graphs

Compute cycles in Kneser graphs $K(n,k)$ via Greene-Kleitman parenthesis matching. First configure a starting vertex, then start the animation of gliders.

Size $n$ of the ground set | |

Size $k$ of the subsets |

Starting vertex (0=white, 1=black; click on bits to toggle them):

Predefined inputs (figure numbers as in the [Paper])

Animation controls

time slices

Current vertex

Gliders in current vertex

Speed set: