• List Price: $79.95
  • Save: $20.78 (26%)
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Want it Friday, April 18? Order within and choose One-Day Shipping at checkout. Details
Used: Good | Details
Sold by RentU
Condition: Used: Good
Comment: Fast shipping from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $35. Overnight, 2 day and International shipping available! Excellent Customer Service.. May not include supplements such as CD, access code or DVD.
Add to Cart
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more

Constructive Combinatorics (Undergraduate Texts in Mathematics) Hardcover

See all 4 formats and editions Hide other formats and editions
Amazon Price New from Used from Collectible from
"Please retry"
Rent from
"Please retry"
$55.18 $27.01
"Please retry"

Up to 50% Off Materials & Chemistry Books
For a limited time, enjoy special savings on materials and chemistry titles from Springer. Learn more

Product Details

  • Series: Undergraduate Texts in Mathematics
  • Hardcover: 186 pages
  • Publisher: Springer; 1st edition (June 1, 1986)
  • Language: English
  • ISBN-10: 0387963472
  • ISBN-13: 978-0387963471
  • Product Dimensions: 9.6 x 6.4 x 0.7 inches
  • Shipping Weight: 13.6 ounces (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #926,413 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
5 star
4 star
3 star
2 star
1 star
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

14 of 18 people found the following review helpful By Sen Peng Eu on May 3, 2000
Format: Hardcover Verified Purchase
Unlike other textbook in the prosperous combinatorics , this introduction book takes a very different pace.It's paradigm is "SHOW me the proof". From the very beginning to the last page ,authors us that we can make a proof clear by write out directly the algorithm or just make a apparent bijection. The book contains 4 chapters, the first 2 stress on basic enumeration objects and posets, the last 2 on bijection and involution. With authour's carefully-selected topic and examples, this book is self-contained. this book shows us the splendid new concepts of combinatorics. I must say that I'm very happy and shocked that ,in such a few pages ,by using combinatorical method developed here we can EASILY prove Cayley's theorem, Vandemonde determinent, Roger-Ramanujan's partition formula. etc. The exercises are excellent too. Very many good seed ideas waiting to be developed.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Product Images from Customers