Constructive Combinatorics (Undergraduate Texts in Mathematics)

Stanton, Dennis; White, Dennis

ISBN 10: 0387963472 / ISBN 13: 9780387963471

Published by Springer, New York, 1986

About this Item

A very good copy of the presumed first hard cover edition (no explicit edition statement, though first priting: full number line)lacking a dust-jacket. The text is wholly unmarked, pristine, and the binding bright and fresh in appearance. A sharp copy. Seller Inventory # 017988

Bibliographic Details

Title: Constructive Combinatorics (Undergraduate ...

Publisher: Springer, New York

Publication Date: 1986

Binding: Hardcover

Condition: Very Good

Dust Jacket Condition: No Jacket

Edition: 1st Edition

About this title

Synopsis:

The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course.

From the Back Cover:

The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student.