Skip to main content
SpringerLink
Log in

On the chromatic number of the direct product of hypergraphs

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

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

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

Access this chapter

Log in via an institution
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. C. Berge, Graphes et hypergraphes, Dunod, 1970.

    Google Scholar 

  2. C. Berge, M. Simonovits: The coloring numbers of the product of two hypergraphs, this volume.

    Google Scholar 

  3. Chvátal, On finite polarized partition relations. Can. Math. Bull. 12, no 3, 1969, 321–326.

    Article  MathSciNet  MATH  Google Scholar 

  4. Čulik, Teilweise Losung eines verallgemeinerten Problems von K. Zarankiewicz. Annales Polonici Math., no 3, 1956, 165–168.

    Google Scholar 

  5. P. Erdös, Some remarks on the theory of graphs. Bull. Amer. Math. Soc., 53, 1947, 292–299.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Erdös, A. Hajnal, On chromatic number of graphs and set-systems. Acta Math. Acad. Sc. Hungaricae, 17, 1966, 61–99.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Erdös, R. Rado, A partition calculus in set theory. Bull. Amer. Math. Soc., 62, 1956, 427–489.

    Article  MathSciNet  MATH  Google Scholar 

  8. R.K. Guy, The Many Facets of Graph Theory, Lecture Notes in Math, no 110, Springer-Verlag, 129–148.

    Google Scholar 

  9. C. Hylten-Cavallius, On a Combinatorial problem. Colloq. Math., 6, 1958, 59–65.

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  11. I. Reiman, Uber ein problem von K. Zarankiewicz. Acta Math. Acad. Sc. Hungaricae, 9, 1958, 269–279.

    Article  MathSciNet  MATH  Google Scholar 

  12. K Zarankiewicz, P. 101, Colloq. Math., 2, 1951, 301.

    Google Scholar 

  13. S. Znam, On a Combinatorial problem of K. Zarankiewicz. Colloq. Math. 11, 1963, 81–84.

    MathSciNet  MATH  Google Scholar 

  14. K.K. Guy S. Znam, A problem of Zarankiewicz. Recent Progress in Combinatorics. (W.T. Tutte ed.) 1969, 237–243.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris VI, France

    F. Sterboul

Authors
  1. F. Sterboul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Berge Dijen Ray-Chaudhuri

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Sterboul, F. (1974). On the chromatic number of the direct product of hypergraphs. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066191

Download citation

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

  • 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

Search

Navigation