The top cell of a Grassmannian can be represented by a bipartite graph embedded in the disk. Plucker coordinates can then be represented via perfect matchings on the graph subject to boundary conditions imposed by the Plucker coordinate. The matchings above are for the Plucker coordinate (145) in Gr(3,6). They are obtained by removing irrelevant edges and nodes from the initial bipartite graph that are determined by the boundary conditions and then solving the matching problem on the resulting graph. It is the matchings for that subgraph that are pictured above. The matching are found via the algorithm presented in Fukuda,Matsui whereby an initial matching was found via the Hopcroft-Karp algorithm. The program was written in python using networkx and pyvis with the Hopcroft-Karp algorithm being taken from an online resource [cite].