Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
On a Min-max Theorem of Cacti

On a Min-max Theorem of Cacti

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1412/1998
BookInteger Programming and Combinatorial Optimization
DOI10.1007/3-540-69346-7
Copyright1998
ISBN978-3-540-64590-0
DOI10.1007/3-540-69346-7_7
Pages84-95
Subject CollectionComputer Science
SpringerLink DateThursday, January 01, 1998
Add to marked items

On a Min-max Theorem of Cacti

Zoltán Szigeti7 Contact Information

(7)  Equipe Combinatoire, Université Paris 6, 75252 Paris, Cedex 05, France
Abstract
A simple proof is presented for the min-max theorem of Lovász on cacti. Instead of using the result of Lovász on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem.
This work was done while the author visited Laboratoire LEIBNIZ, Institut IMAG, Grenoble.

Contact Information Zoltán Szigeti
Email: Zoltan.Szigeti@ecp6.jussieu.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.105 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)