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? In order to represent the matching on the associated Hasse Diagram of the poset, we just reverse the arrows which are not in the matching. The matching is acyclic (Morse) if the matching represented on its Hasse Diagram is acyclic. By maximal matching I mean one with the maximal number of elements. Any help would be appreciated. |

2020-09-05 13:17:59 +0200 | received badge | ● Scholar (source) |

2020-09-04 14:39:21 +0200 | asked a question | Maximal matching of a poset Hi, I would like to know how to find a maximal matching (defined below) of a given finite poset. A matching of a poset is the same as a matching of its Hasse Diagram. I thought about using the matching() function for graphs, however, it seems that the Hasse diagram of a poset is a Digraph for Sage and so the matching function does not work. By maximal matching I mean one with the maximal number of elements. Any help would be appreciated. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.