Skip to main content
SpringerLink
Log in
Book cover

Hypergraph Seminar pp 54–60Cite as

The chromatic index of an infinite complete hypergraph: A partition theorem

  • 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.

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

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. W. J. Frascella, Certain counterexamples to the construction of combinatorial designs on infinite sets, Notre-Dame journal of formal logic, 12, no4, (1971), p. 461–466.

    Article  MathSciNet  MATH  Google Scholar 

  3. K. Kuratowski and A. Mostowski, Set theory, North Holland and Polish scientific publishers (1968).

    Google Scholar 

  4. A. Tarski, Sur la décomposition des ensembles en sous-ensembles presque disjoints, Fundamenta Mathematicae, 12, (1928), p. 188–205; 14, (1929), p. 205–215.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Lyon, France

    R. Bonnet

  2. Hungarian Academy of Science, Hungary

    P. Erdös

Authors
  1. R. Bonnet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Erdös
    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

Bonnet, R., Erdös, P. (1974). The chromatic index of an infinite complete hypergraph: A partition theorem. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066178

Download citation

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

  • 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