このページのリンク

引用にはこちらのURLをご利用ください

利用統計

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

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

<図書>
Combinatorics and graph theory

責任表示 John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff
シリーズ Undergraduate texts in mathematics
データ種別 図書
出版者 New York : Springer
出版年 c2000
本文言語 英語
大きさ xiii, 225 p. : ill. ; 25 cm
概要 This book evolved from several courses in combinatorics and graph theory given at Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring,...matchings, and Ramsey theory. Chapter 2 studies combinatorics, including the principle of inclusion and exclusion, generating functions, recurrence relations, P=lya theory, the stable marriage problem, and several important classes of numbers. Chapter 3 presents infinite pigeonhole principles, K÷nig's lemma, and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enthusiastic and lively style. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The text is primarily directed toward upper-division undergraduate students, but lower-division undergraduates with a penchant for proof and graduate students seeking an introduction to these subjects will also find much of interest. 続きを見る
電子版へのリンク

所蔵情報


理系図3F 数理独自 HARR/35/1 2000
023212000004146

書誌詳細

一般注記 Includes bibliographical references (p. [211]-217) and index
著者標目 *Harris, John M. (John Michael), 1969-
Hirst, Jeffry L., 1957-
Mossinghoff, Michael J., 1964-
件 名 LCSH:Combinatorial analysis
LCSH:Graph theory
分 類 NDC9:411.22
LCC:QA165
DC21:511/.6
書誌ID 1001390961
ISBN 0387987363
NCID BA47912391
巻冊次 ISBN:0387987363
登録日 2009.11.02
更新日 2009.11.02

類似資料