000 | 03162nam a22004695i 4500 | ||
---|---|---|---|
001 | 978-3-540-37803-7 | ||
003 | DE-He213 | ||
005 | 20190213151608.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1974 gw | s |||| 0|eng d | ||
020 |
_a9783540378037 _9978-3-540-37803-7 |
||
024 | 7 |
_a10.1007/BFb0066173 _2doi |
|
050 | 4 | _aQA166-166.247 | |
072 | 7 |
_aPBV _2bicssc |
|
072 | 7 |
_aMAT013000 _2bisacsh |
|
072 | 7 |
_aPBV _2thema |
|
082 | 0 | 4 |
_a511.5 _223 |
245 | 1 | 0 |
_aHypergraph Seminar _h[electronic resource] : _bOhio State University 1972 / _cedited by Claude Berge, Dijen Ray-Chaudhuri. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1974. |
|
300 |
_aXII, 292 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v411 |
|
505 | 0 | _aIsomorphism 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. | |
650 | 0 | _aMathematics. | |
650 | 1 | 4 |
_aGraph Theory. _0http://scigraph.springernature.com/things/product-market-codes/M29020 |
650 | 2 | 4 |
_aMathematics, general. _0http://scigraph.springernature.com/things/product-market-codes/M00009 |
700 | 1 |
_aBerge, Claude. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRay-Chaudhuri, Dijen. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662163054 |
776 | 0 | 8 |
_iPrinted edition: _z9783540068464 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v411 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0066173 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c11229 _d11229 |