zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Notes on introductory combinatorics. (English) Zbl 0632.05001
Progress in Computer Science, No.4. Boston-Basel-Stuttgart: Birkhäuser. IX, 192 p. (1983).

Let me quote from the introductory notes: “In the winter of 1978, G. Pólya and R. Tarjan teamed up at Stanford University to teach a course titled ‘Introduction to Combinatorics’. This book consists primarily of the class notes and related material produced by D. Woods as teaching assistant for the course.”

“Among the topics covered in the notes are elementary subjects such as combinations and permutations, mathematical tools such as generating functions and Pólya’s theory of counting, and specific problems such as Ramsey theory, matchings, and Hamiltonian and Eulerian paths.”

These notes also contain the midterm and the final examinations. In the preface, R. Tarjan describes what his cooperation with the late G. Pólya meant to him. The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya.

Reviewer: H.Kröger

05-01Textbooks (combinatorics)
05A15Exact enumeration problems, generating functions
05C45Eulerian and Hamiltonian graphs
05C10Topological graph theory
05C15Coloring of graphs and hypergraphs
05A05Permutations, words, matrices
05A10Combinatorial functions
05C70Factorization, etc.