Skip to main content

On a property of hypergraphs with no cycles of length greater than two

  • Part I: General Hypergraphs
  • Conference paper
  • First Online:

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

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

Buying options

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

Learn about institutional subscriptions

References

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

    MATH  Google Scholar 

  2. M. Las Vergnas, Problèmes de couplages et problèmes hamiltoniens en Théorie des Graphes, Thèse, Paris 1972.

    Google Scholar 

  3. L. Lovász, Graphs and set-systems, in Beiträge zur Graphentheorie, éd. H. Sachs, H.S. Voss & H. Walther, Teubner, 1968, pp. 99–106.

    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

Hansen, P., Las Vergnas, M. (1974). On a property of hypergraphs with no cycles of length greater than two. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066184

Download citation

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

  • 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