このページのリンク

利用統計

  • このページへのアクセス:5回

  • 貸出数:2回
    (1年以内の貸出数:0回)

<図書>
Hypergraphs : combinatorics of finite sets

責任表示 Claude Berge
シリーズ North-Holland mathematical library ; v. 45
データ種別 図書
出版者 Amsterdam ; Tokyo : North Holland
出版年 1989
本文言語 英語
大きさ ix, 255 p. : ill. ; 23 cm
概要 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 Turan and Konig. 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. 続きを見る

所蔵情報


理系図1F 開架 068252191007753 410.9/B 38 1989

理系図3F 数理独自 068222189008164 BERG/50/8 1989

書誌詳細

別書名 原タイトル:Hypergraphes: combinatoires des ensembles finis
一般注記 Translation of: Hypergraphes
Bibliography: p. [237]-255
Includes index
著者標目 *Berge, Claude
件 名 LCSH:Hypergraphs
NDLSH:グラフ理論
分 類 LCC:QA166.23
DC20:511/.5
NDC8:410.9
書誌ID 1001073336
ISBN 0444874895
NCID BA07410660
巻冊次 ISBN:0444874895
登録日 2009.09.17
更新日 2009.09.17

類似資料