Skip to main content
Book cover

Graph Theory pp 122–124Cite as

A covering theorem for hypergraphs

  • 1310 Accesses

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

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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, Graph and Hypergraphs, North Holland, (1973).

    Google Scholar 

  2. D. König, Graphen und Matrizen, Mat. Fiz. Lapok, 38 (1931), 116–119.

    MATH  Google Scholar 

  3. J. Lehel and Zs. Tuza, Triangle-free partial graphs and edge covering theorems, Discrete Math. 39 (1982), 59–65.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Lehel, J. (1983). A covering theorem for hypergraphs. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071621

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive