Skip to main content
SpringerLink
Log in

An exact upper bound to the maximum number of perfect matchings in cubic pseudographs

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

The present paper shows that the function Φ (n)=2n+1 is an upper bound to the maximum number of distinct perfect matchings in cubic, connected pseudographs with2n vertices. Moreover examples of pseudographs are given which exactly realize such a bound.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Berge,Graphes et Hypergraphes, (1970) Dunod, Paris.

    MATH  Google Scholar 

  2. F. Harary,Graph Theory, (1971) Addison-Wesley Publishing Co., Reading, MA.

    Google Scholar 

  3. E. W. Montroll,Lattice Statistics, in «Applied Combinatorial Mathematics» (E. F. Beckenbach ed.), (1964) Wiley, New York, NY.

    Google Scholar 

  4. P. W. Kasteleyn,Graph Theory and Crystal Physics, in «Graph Theory and theoretical Physics», (F. Harary ed.), (1967) Academic Press, London.

    Google Scholar 

  5. J. Petersen,Die Theorie der regulaeren Graphen, Acta Math.15 (1981), 193–220.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto Matematico, Università degli Studi, 27100, Pavia

    G. Galbiati

Authors
  1. G. Galbiati
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was carried out while the author was visiting the Department of Electrical Engineering and Computer Science of the University of California at Berkeley. It was supported in part by a grant from Consiglio Nazionale delle Ricerche, Roma, Italy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galbiati, G. An exact upper bound to the maximum number of perfect matchings in cubic pseudographs. Calcolo 18, 361–370 (1981). https://doi.org/10.1007/BF02576436

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02576436

Keywords

Search

Navigation