Abstract
Abstract A tournament T = ( V , A ) is called cycle Mengerian (CM) if it satisfies the minimax relation on packing and covering cycles, for every nonnegative integral weight function defined on A. The purpose of this series of two papers is to show that a tournament is CM iff it contains none of four Mobius ladders as a subgraph; such a tournament is referred to as Mobius-free. In the first paper we have given a structural description of all Mobius-free tournaments, and have proved that every CM tournament is Mobius-free. In this second paper we establish the converse by using our structural theorems and linear programming approach.
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.
