2021-05-18 07:33:17 +0200 received badge ● Student (source) 2020-09-05 14:30:23 +0200 commented question Computing maximal acyclic matchings I am not familiar with the Sage, but I understand from the information on that link, that the function I ask for will be ready in Sage 9.3 in just 3 weeks? 2020-09-05 13:28:11 +0200 received badge ● Editor (source) 2020-09-05 13:25:44 +0200 asked a question Computing maximal acyclic matchings Hi, Is there a function to compute the maximal acyclic (Morse) matching (defined below) of a given finite poset?  A matching M in a poset X is a subset M of X x X such that: 1) if (x, y) is in M, then x is an immediate predecessor of y (x