Skip to main content

Nombres de coloration de l’hypergraphe h-parti complet

Part I: General Hypergraphs

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

Keywords

  • Combinatorial Theory
  • Intersection Theorem
  • Graphe Representatif
  • Transversal Minimum
  • Inaugural Dissertation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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. C. Berge, Graphes et Hypergraphes, Dunod, Paris, 1970

    MATH  Google Scholar 

  2. B. Lindström, A Theorem on families of Sets, J. of Combinatorial Theory, A. 13, 1972, 274–277.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. P. Erdös, Chao Ko, R. Rado, Intersection theorems for systems of finite sets, Quart. J. of Math. (Oxford) (2) 12 (1961), 313–320.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. E. Lucas, Récréations Mathématiques, A. Blanchard, Paris, 1892–1924.

    MATH  Google Scholar 

  5. R. Peltesohn, Das Turnier Problem für Spiele zu je dreier, Inaugural Dissertation, Friedrich-Wilhelms-Universität zu Berlin 1936.

    Google Scholar 

  6. J.C. Meyer, Quelques problèmes concernant les cliques des hypergraphes h-complets et q-parti h-complets. Working Seminar on Hypergraphs, Columbus Ohio (1972), Springer-Verlag.

    Google Scholar 

  7. R.P. Gupta, A decomposition theorem for binartite graphs, Théorie des graphes, Romme I.C.C. (P. Rosenstiel ed.), Dunod, Paris, 1967, 135–138.

    Google Scholar 

Download references

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. (1974). Nombres de coloration de l’hypergraphe h-parti complet. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066175

Download citation

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

  • 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