Hypergraphs: combinatorics of finite sets

Hypergraphs: combinatorics of finite sets

C. Berge
როგორ მოგეწონათ ეს წიგნი?
როგორი ხარისხისაა ეს ფაილი?
ჩატვირთეთ, ხარისხის შესაფასებლად
როგორი ხარისხისაა ჩატვირთული ფაილი?
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.
კატეგორია:
წელი:
1989
გამოცემა:
1
გამომცემლობა:
Elsevier, Academic Press
ენა:
english
გვერდები:
267
ISBN 10:
0444874895
ISBN 13:
9780444874894
სერია:
North-Holland Mathematical Library 45
ფაილი:
PDF, 3.80 MB
IPFS:
CID , CID Blake2b
english, 1989
ჩატვირთვა (pdf, 3.80 MB)
ხორციელდება კონვერტაციის -ში
კონვერტაციის -ში ვერ მოხერხდა

საკვანძო ფრაზები