Hypergraph Seminar

Inhaltsverzeichnis

• Isomorphism problems for hypergraphs.
• Nombres de coloration de l’hypergraphe h-parti complet.
• The coloring numbers of the direct product of two hypergraphs.
• Graphe representatif de l’hypergraphe h-parti complet.
• The chromatic index of an infinite complete hypergraph: A partition theorem.
• Intersecting families of edges in hypergraphs having the hereditary property.
• On theorems of berge and fournier.
• Extremal problems on graphs and hypergraphs.
• Hypergraph reconstruction.
• Une condition pour qu’un hypergraphe, ou son complementaire, soit fortement isomorphe a un hypergraphe complet.
• On a property of hypergraphs with no cycles of length greater than two.
• Sur les hypergraphes bichromatiques.
• Minimax theorems for hypergraphs.
• Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets.
• Reconstruction theorems for infinite hypergraphs.
• Note on a hypergraph extremal problem.
• Sur une conjecture de V. Chvatal.
• On the chromatic number of the direct product of hypergraphs.
• Every directed graph has a semi-kernel.
• Elementary strong maps and transversal geometries.
• Some problems in graph theory.
• Aspects of the theory of hypermatroids.
• Facets of I-matching polyhedra.
• Chromials.
• Some partitions of all triples into steiner triple systems.
• Unsolved problems.