Skip to main content
SpringerLink
Log in

Tight Bounds on Maximal and Maximum Matchings

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2001)

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

Included in the following conference series:

Abstract

In this paper, we study bounds on maximal and maximum matchings in special graph classes, speci.cally triangulated graphs and graphs with bounded maximum degree. For each class, we give a lower bound on the size of matchings, and prove that it is tight for some graph within the class.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U. S. A., 43:842–844, 1957. 311

    Google Scholar 

  2. T. Biedl, P. Bose, E. Demaine, and A. Lubiw. Effcient algorithms for Petersen’s theorem. J. Algorithms, 38:110–134, 2001.

    Article  MATH  Google Scholar 

  3. J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.

    Google Scholar 

  4. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E logD) time. Technical Report TR1999-792, Department of Computer Science, New York University, September 1999.

    Google Scholar 

  5. C. Duncan, M. Goodrich, and S. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In Graph Drawing (GD’99), volume 1731 of Lecture Notes in Computer Science, pages 186–196. Springer-Verlag, 1999. Accepted for publication in Computational Geometry: Theory and Applications.

    Chapter  Google Scholar 

  6. P. Hall. On representation of subsets. Journal of the London Mathematical Society, 10:26–30, 1935.

    MATH  Google Scholar 

  7. J. E. Hopcroft and R. M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225–231, 1973.

    Article  MathSciNet  MATH  Google Scholar 

  8. G. Kant. A more compact visibility representation. Internat. J. Comput. Geom. Appl., 7(3):197–210, 1997.

    Article  MathSciNet  Google Scholar 

  9. D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77:453–465, 1916.

    Article  MathSciNet  MATH  Google Scholar 

  10. S. Micali and V. V. Vazirani. An O(p√ V. E ) algorithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science, pages 17–27, New York, 1980. Institute of Electrical and Electronics Engineers Inc. (IEEE).

    Google Scholar 

  11. J. Petersen. Die Theorie der regulären graphs (The theory of regular graphs). Acta Mathematica, 15:193–220, 1891.

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Schrijver. Bipartite edge coloring in O(Δm) time. SIAM J. Comput., 28(3):841–846, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  13. W. T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107–111, 1947.

    Article  MathSciNet  MATH  Google Scholar 

  14. W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99–116, 1956.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Waterloo University, Waterloo, Canada

    Therese Biedl & Erik D. Demaine

  2. Department of Computer Science, University of Miami, Miami, FL, USA

    Christian A. Duncan

  3. Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong

    Rudolf Fleischer

  4. Department of Computer Science, University of Arizona, Tucson, AZ, USA

    Stephen G. Kobourov

Authors
  1. Therese Biedl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian A. Duncan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rudolf Fleischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Stephen G. Kobourov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Basser Department of Computer Science, University of Sydney, Madsen Building F09, 2006, Sydney, NSW, Australia

    Peter Eades

  2. Department of Computer Science, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Tadao Takaoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biedl, T., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G. (2001). Tight Bounds on Maximal and Maximum Matchings. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation