Abstract
Abstract This work is focused on the links between Formanʼs discrete Morse theory and graph theory. More precisely, we are interested on putting the optimization of a discrete Morse function in terms of matching theory. It can be done by describing the process of cancellation of pairs of critical simplices by means of obtaining Morse matchings on the corresponding Hasse diagram with a greater number of edges using the combinatorial notion of transference.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
