The page "The maximum matching of a bipartite graph is the matroid crossing of a partitioned matroid pair" does not exist in ja language.
Try English version