Skip to main content

Aspects of the theory of hypermatroids

  • Part II: Graphs, Matroids, Designs
  • Conference paper
  • First Online:
Hypergraph Seminar

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 411))

Abstract

The concept of a matroid is generalized by imitating the generalization of a graph to a hypergraph.

Two basic examples of such hypermatroids are given. The first type models the coloring problem for hypergraphs whereas the second one is related to coverings of hypergraphs. This second example, covering hypermatroids, is the proper extension of trivial matroids. Covering hypermatroids are characterized by a generalized semimodularity condition.

It is shown how all hypermatroids can be naturally constructed from suitable matroids.

A Poincaré polynomial is defined for hypermatroids. The coloring polynomial for hypergraphs is seen to be a special case. For covering hypermatroids the Poincaré polynomial yields a polynomial identity which gives an enumerative relationship between the covering sets and the transversal sets of a hypergraph.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
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. Berge, C., Graphes et hypergraphes, Dunod, Paris, 1970.

    MATH  Google Scholar 

  2. Crapo H., Möbius Inversion in Lattices, Archiv der Math. 19 (1968), 595–607.

    Article  MathSciNet  MATH  Google Scholar 

  3. Crapo H., The Tutte Polynomial, Aequationes Math. 3 (1969), 211–229.

    Article  MathSciNet  MATH  Google Scholar 

  4. Crapo H. and Rota G-C., On the Foundations of Combinatorial Theory: Combinatorial Geometries, M.I.T. Press, Cambridge, 1970.

    MATH  Google Scholar 

  5. Dilworth, R.P., Dependence Relations in a Semimodular Lattice, Duke Math. J. 11 (1944), 575–587.

    Article  MathSciNet  MATH  Google Scholar 

  6. Edmonds, J., Submodular Functions, Matroids, and Certain Polyhedra, pp. 69–87 in Guy, R. et al. (editors), Combinatorial Structures and their Applications, Gordon and Breach, New York etc., 1970.

    Google Scholar 

  7. Harary, F. and Welsh, D., Matroids versus Graphs, pp. 155–170 in Chartrand, G. et al. (editors). The Many Facets of Graph Theory, Springer-Verlag, Berlin etc. 1969.

    Chapter  Google Scholar 

  8. Helgason, T., On hypergraphs and Hypergeometries, thesis Massachusetts Institute of Technology, 1971 supervised by Gian-Carlo Rota.

    Google Scholar 

  9. Pareigis, B., Categories and Functors, Academic Press, New York etc., 1970.

    MATH  Google Scholar 

  10. Rota, G-C., On the Foundations of Combinatorial Theory I: The Möbius Functions, Z. Wahrscheinlichkeitsth. und verw. Gebiete, 2 (1964), 340–368.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Claude Berge Dijen Ray-Chaudhuri

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Helgason, T. (1974). Aspects of the theory of hypermatroids. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066195

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06846-4

  • Online ISBN: 978-3-540-37803-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics