Hypergraph Seminar : Ohio State University, 1972

C. Berge

ISBN 10: 3540068465 / ISBN 13: 9783540068464

Published by Springer, Springer Vieweg, 1974

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783540068464

Bibliographic Details

• Title: Hypergraph Seminar : Ohio State University, 1972
• Publisher: Springer, Springer Vieweg
• Publication Date: 1974
• Language: English
• ISBN 10: 3540068465
• ISBN 13: 9783540068464
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 17D millimeters 235 millimeters width by 155 millimeters height by 17 millimeters depth
• Weight: 464 grams

About this title

Synopsis

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 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.