Abstract
A strong version of the duality theorem of linear programming is proved for fractional covers and matchings in countable graphs. It is conjectured to hold for general hypergraphs. In Section 2 we show that in countable hypergraphs there does not necessarily exist a maximal matchable set, contrary to the situation in graphs.
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.
