The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set.
An edition of Enumerative Combinatorics, Volume 1
(1986)
Enumerative Combinatorics, Volume 1
1st edition
by Richard P. Stanley
Share
×Close
Last edited by IdentifierBot
August 6, 2010 | History
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
Enumerative Combinatorics, Volume 1
May 2000, Cambridge University Press
Paperback
in English
- 2nd edition
0521663512 9780521663519
|
zzzz
|
2
Enumerative Combinatorics, Volume 1
July 31, 1986, Wadsworth and Brooks / Cole, Chapman and Hall
Hardcover
in English
- 1st edition
0534065465 9780534065461
|
aaaa
|
Book Details
First Sentence
"The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set."
The Physical Object
Edition Identifiers
Work Identifiers
Excerpts
added anonymously.
Community Reviews (0)
Lists
See All
History
- Created April 29, 2008
- 5 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| August 6, 2010 | Edited by IdentifierBot | added LibraryThing ID |
| April 24, 2010 | Edited by Open Library Bot | Fixed duplicate goodreads IDs. |
| April 16, 2010 | Edited by bgimpertBot | Added goodreads ID. |
| December 14, 2009 | Edited by WorkBot | link works |
| April 29, 2008 | Created by an anonymous user | Imported from amazon.com record |