![](https://image.librarything.com/pics/fugue21/magnifier-left.png)
![](https://images-na.ssl-images-amazon.com/images/P/0444874895.01._SX180_SCLZZZZZZZ_.jpg)
Klik op een omslag om naar Google Boeken te gaan.
Bezig met laden... Hypergraphs, Volume 45: Combinatorics of Finite Sets (North-Holland Mathematical Library)door Claude Berge
Geen Bezig met laden...
![]() Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden. Op dit moment geen Discussie gesprekken over dit boek. Geen besprekingen geen besprekingen | voeg een bespreking toe
Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge'' and in calling the family itself a ``hypergraph'', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems of Turán and König. It was noticed that this generalisation often led to simplification; moreover, one single statement, sometimes remarkably simple, could unify several theorems on graphs. This book presents what seems to be the most significant work on hypergraphs. Geen bibliotheekbeschrijvingen gevonden. |
Actuele discussiesGeen
![]() GenresDewey Decimale Classificatie (DDC)511.5Natural sciences and mathematics Mathematics General Principles Graph TheoryLC-classificatieWaarderingGemiddelde: Geen beoordelingen.Ben jij dit?Word een LibraryThing Auteur. |