Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0949.05001
Harris, John M.; Hirst, Jeffry L.; Mossinghoff, Michael J.
Combinatorics and graph theory. (English)
[B] Undergraduate Texts in Mathematics. Berlin: Springer. xiii, 225 p. DM 69.00; öS 504.00; sFr. 63.00; \sterling 24.00; \$ 44.95 (2000). ISBN 0-387-98736-3/hbk

This book for undergraduate mathematics students covers the following three central fields: Graph theory, Combinatorics, Infinite combinatorics and graphs. Chapter 1 focuses on the theory of finite graphs: trees, planarity, colouring, matchings, and Ramsey theory. Chapter 2 develops the central techniques of enumerative combinatorics: the principle of inclusion and exclusion, the theory and application of generating functions, the solution of recurrence relations, Pólya's theory of counting arrangements in the presence of symmetry, and important classes of numbers, including the Fibonacci, Catalan, Stirling, Bell, and Euler numbers. Chapter 3 presents infinite pigeonhole principles: König's lemma and Ramsey's theorem. This chapter gives an excellent invitation to combinatorial set theory. The text contains fully worked out examples, exercises at the end of each subchapter, hints and references for further study.
[J.Fiamčik (Prešov)]

MSC 2000:: *05-01 Textbooks (combinatorics)
05Cxx Graph theory
03E05 Combinatorial set theory (logic)

Cited in: Zbl 1170.05001

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.
	Elementary number theory. Primes, congruences, and secrets.

Simple Search

Zentralblatt MATH Berlin [Germany]