Skip to main content

The coloring numbers of the direct product of two hypergraphs

Part I: General Hypergraphs

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

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
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

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. Brown, W. G., On graphs which do not contain a Thomsen graph, Canad. Math. Bull. 9, 1966, 281–285.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Chvátal, V., Hypergraphs and Ramseyian theorems, Thesis, Univ. of Waterloo, 1970.

    Google Scholar 

  4. Chvátal, V., On finite polarized partition relations, Canad. Math. Bull. 12, 1969, 321–326.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Čulik, K., Teilweise Losung eines verallgemeinerten Problems von K. Zarankiewicz, Ann. Polon. Math. 3, 1956, 165–168.

    MathSciNet  MATH  Google Scholar 

  6. Erdös, P., and Rado, R., A partition calculus in set theory, Bull. A.M.S. 62, 1956, 427–489.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Guy, R. K., A problem of Zarankiewicz in Theory of Graphs, Akadémiai Kiadó, Budapest, 1968, 119–150.

    Google Scholar 

  8. Guy, R. K., A many-facetted problem of Zarankiewicz, in The many Facets of Graph Theory, Lecture Notes 110, Springer Verlag, Berlin 1969, 129–148.

    CrossRef  Google Scholar 

  9. Kövary, T., Sós, V., and Turán, P., On a problem of Zarankiewicz, Colloq. Math. 3, 1954, 50–57.

    MathSciNet  MATH  Google Scholar 

  10. Lovász, L., Minimax theorems for hypergraphs, in Hypergraph Seminar, Lecture Notes, Springer Verlag, Berlin 1974.

    Google Scholar 

  11. Sterboul, F., On the chromatic number of the direct product of two hypergraphs, this volume, p.173.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Berge, C., Simonovits, M. (1974). The coloring numbers of the direct product of two hypergraphs. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066176

Download citation

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

  • 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