Hypergraph Seminar

Ohio State University 1972

Editors:

ISBN: 978-3-540-06846-4 (Print) 978-3-540-37803-7 (Online)

Table of contents (26 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-12

    Isomorphism problems for hypergraphs

  2. No Access

    Book Chapter

    Pages 13-20

    Nombres de coloration de l’hypergraphe h-parti complet

  3. No Access

    Book Chapter

    Pages 21-33

    The coloring numbers of the direct product of two hypergraphs

  4. No Access

    Book Chapter

    Pages 34-53

    Graphe representatif de l’hypergraphe h-parti complet

  5. No Access

    Book Chapter

    Pages 54-60

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

  6. No Access

    Book Chapter

    Pages 61-66

    Intersecting families of edges in hypergraphs having the hereditary property

  7. No Access

    Book Chapter

    Pages 67-74

    On theorems of berge and fournier

  8. No Access

    Book Chapter

    Pages 75-84

    Extremal problems on graphs and hypergraphs

  9. No Access

    Book Chapter

    Pages 85-94

    Hypergraph reconstruction

  10. No Access

    Book Chapter

    Pages 95-98

    Une condition pour qu’un hypergraphe, ou son complementaire, soit fortement isomorphe a un hypergraphe complet

  11. No Access

    Book Chapter

    Pages 99-101

    On a property of hypergraphs with no cycles of length greater than two

  12. No Access

    Book Chapter

    Pages 102-110

    Sur les hypergraphes bichromatiques

  13. No Access

    Book Chapter

    Pages 111-126

    Minimax theorems for hypergraphs

  14. No Access

    Book Chapter

    Pages 127-139

    Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets

  15. No Access

    Book Chapter

    Pages 140-146

    Reconstruction theorems for infinite hypergraphs

  16. No Access

    Book Chapter

    Pages 147-151

    Note on a hypergraph extremal problem

  17. No Access

    Book Chapter

    Pages 152-164

    Sur une conjecture de V. Chvatal

  18. No Access

    Book Chapter

    Pages 165-174

    On the chromatic number of the direct product of hypergraphs

  19. No Access

    Book Chapter

    Pages 175-175

    Every directed graph has a semi-kernel

  20. No Access

    Book Chapter

    Pages 176-186

    Elementary strong maps and transversal geometries

previous Page of 2