Hypergraph Seminar: Ohio State University 1972

Isomorphism problems for hypergraphs....Pages 1-12
Nombres de coloration de l’hypergraphe h-parti complet....Pages 13-20
The coloring numbers of the direct product of two hypergraphs....Pages 21-33
Graphe representatif de l’hypergraphe h-parti complet....Pages 34-53
The chromatic index of an infinite complete hypergraph: A partition theorem....Pages 54-60
Intersecting families of edges in hypergraphs having the hereditary property....Pages 61-66
On theorems of berge and fournier....Pages 67-74
Extremal problems on graphs and hypergraphs....Pages 75-84
Hypergraph reconstruction....Pages 85-94
Une condition pour qu’un hypergraphe, ou son complementaire, soit fortement isomorphe a un hypergraphe complet....Pages 95-98
On a property of hypergraphs with no cycles of length greater than two....Pages 99-101
Sur les hypergraphes bichromatiques....Pages 102-110
Minimax theorems for hypergraphs....Pages 111-126
Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets....Pages 127-139
Reconstruction theorems for infinite hypergraphs....Pages 140-146
Note on a hypergraph extremal problem....Pages 147-151
Sur une conjecture de V. Chvatal....Pages 152-164
On the chromatic number of the direct product of hypergraphs....Pages 165-174
Every directed graph has a semi-kernel....Pages 175-175
Elementary strong maps and transversal geometries....Pages 176-186
Some problems in graph theory....Pages 187-190
Aspects of the theory of hypermatroids....Pages 191-213
Facets of I-matching polyhedra....Pages 214-242
Chromials....Pages 243-266
Some partitions of all triples into steiner triple systems....Pages 267-277
Unsolved problems....Pages 278-287