Hypergraph Seminar
Springer Berlin (Verlag)
978-3-540-06846-4 (ISBN)
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.
| Erscheint lt. Verlag | 16.10.1974 |
|---|---|
| Reihe/Serie | Lecture Notes in Mathematics |
| Zusatzinfo | XII, 292 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 431 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| Schlagworte | Extrema • Finite • Geometry • Graph • Graphs • graph theory • Hypergraph • Matching • Minimum • Morphism • Theorem |
| ISBN-10 | 3-540-06846-5 / 3540068465 |
| ISBN-13 | 978-3-540-06846-4 / 9783540068464 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
