Skip to main content
SpringerLink
Log in

On a Min-max Theorem of Cacti

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1412))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Anderson. Perfect matchings of a graph. Journal of Combinatorial Theory, Series B, 10:183–186, 1971.

    Article  MATH  Google Scholar 

  2. P. Jensen and B. Korte, Complexity of matroid property algorithms. SIAM J. Comput., 11:184–190, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. Lovász. Matroid matching problem. In Algebraic Methods in Graph Theory. Colloquia Mathematica Societatis J. Bolyai 25, Szeged, 1978.

    Google Scholar 

  4. L. Lovász and M. D. Plummer. Matching Theory. North Holland, Amsterdam, 1986.

    MATH  Google Scholar 

  5. W. Mader. Über die maximalzahl kreuzungsfreier H-wege. Archiv der Mathematik, 31, 1978.

    Google Scholar 

  6. L. Nebesky. A new characterization of the maximum genus of a graph. Czechoslovak Mathematical Journal, 31, 1981.

    Google Scholar 

  7. A. Recski. Matroid Theory and its Applications in Electric Network Theory and in Statics. Akadémiai Kiadó, Budapest, 1989.

    Google Scholar 

  8. Z. Szigeti. On the graphic matroid parity problem. In preparation.

    Google Scholar 

  9. W. T. Tutte. Graph Factors. Combinatorica, 1:79–97, 1981.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe Combinatoire, Université Paris 6, 75252, Paris, Cedex 05, France

    Zoltán Szigeti

Authors
  1. Zoltán Szigeti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computational and Applied Mathematics, Rice University, 6020 Annapolis, Houston, TX, 77005, USA

    Robert E. Bixby

  2. PROS Strategic Solutions, 3223 Smith Street, Houston, TX, 77006, USA

    E. Andrew Boyd

  3. Department of Industrial, Engineering, Texas A&M University, 1000 Country Place Dr. Apt. 69, Houston, TX, 77079, USA

    Roger Z. Ríos-Mercado

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szigeti, Z. (1998). On a Min-max Theorem of Cacti. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-69346-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64590-0

  • Online ISBN: 978-3-540-69346-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation