Skip to main content

Minimax theorems for hypergraphs

Part I: General Hypergraphs

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

Keywords

  • Bipartite Graph
  • Chromatic Number
  • Orientable Graph
  • Perfect Graph
  • Minimax Theorem

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. Berge, C., Färbung von Graphen deren sämtliche bzw. ungerade Kreise starr sind (Zusammenfassung) Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math. — Natur. Reihe (1961), 114–115.

    Google Scholar 

  2. Berge, C., Sur certains hypergraphes generalisant les graphes bipartites, Comb. Theory and its Appl., Bolyai J. Math. Soc. — North Holland Publ. Co. Budapest-Amsterdam-London, 1970, 119–133.

    Google Scholar 

  3. Berge, C., Graphes et hypergraphes, Dunod, Paris, 1970.

    MATH  Google Scholar 

  4. Berge, C. and Las Vergnas, M., Sur un theoreme du type Kőnig pour hypergraphes, Int. Conf. on Comb. Math., New York, 1970, 32–40.

    Google Scholar 

  5. Edmonds, J., Oral Communication at the Hypergraph Seninar, Columbus, September 1972.

    Google Scholar 

  6. Fournier, J. C., Las Vergnas, M., Une classe d’hypergraphes bichromatiques, Discret Math. 2(1972) 407–410.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Fulkerson, D. R. Anti-blocking pairs of polyhedra, to appear in J. Comb. Theory.

    Google Scholar 

  8. Gallai, T., Graphen mit triangularbaren ungeraden Vielecken, Mat. Kut. Int. Kőzl. 7 (1962) 3–36.

    MathSciNet  MATH  Google Scholar 

  9. Gallai, T., Kritische Graphen II, Mat. Kut Int. Közl. 8 (1963) 373–395.

    MathSciNet  MATH  Google Scholar 

  10. Lovasz, L. Normal hypergraphs and the perfect graph conjecture, Discrete Math 2(1972) 253–267.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Lovasz, L., A characterization of perfect graph, to appear in J. Comb. Theory.

    Google Scholar 

  12. Sachs, H., On the Berge conjecture concerning perfect graphs, Comb. Structures and their Appl., Gordon and Breach, New York-London-Paris, 1969, 377–384.

    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

Lovász, L. (1974). Minimax theorems for hypergraphs. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066186

Download citation

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

  • 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