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
2nd edition
by Richard P. Stanley
Share
×Close
This work 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
|
aaaa
|
2
Enumerative Combinatorics, Volume 1
July 31, 1986, Wadsworth and Brooks / Cole, Chapman and Hall
Hardcover
in English
- 1st edition
0534065465 9780534065461
|
zzzz
|
Book Details
First Sentence
"The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set."
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Internet Archive item recordInternet Archive item record
Internet Archive item record
Better World Books record
Promise Item
Excerpts
added anonymously.
Community Reviews (0)
Lists
| August 23, 2020 | Edited by ImportBot | import existing book |
| July 30, 2014 | Edited by ImportBot | import new book |
| April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
| February 7, 2010 | Edited by WorkBot | add more information to works |
| December 10, 2009 | Created by WorkBot | add works page |