A course in combinatorics. (Q2755077)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A course in combinatorics. |
scientific article; zbMATH DE number 1668959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A course in combinatorics. |
scientific article; zbMATH DE number 1668959 |
Statements
5 November 2001
0 references
combinatorics
0 references
graph
0 references
network
0 references
code
0 references
design
0 references
partition
0 references
Ramsey theory
0 references
extremal graphs
0 references
poset
0 references
generating function
0 references
Hadamard matrix
0 references
Latin square
0 references
combinatorial geometry
0 references
projective geometry
0 references
difference set
0 references
coloring
0 references
embedding
0 references
permanent
0 references
parallelism
0 references
Pólya theory
0 references
association scheme
0 references
strongly regular graph
0 references
eigenvalues
0 references
Lovász sieve
0 references
block designs
0 references
list colorings
0 references
A course in combinatorics. (English)
0 references
In my review of the first edition of this book, I wrote: I highly recommend this text for anyone who wishes to see what combinatorics is about on a level which does justice to its depth; it will no doubt become a standard choice among the many texts on combinatorics. This prediction has certainly become reality: The book has been used successfully at many colleges and universities as a textbook. Apart from correcting minor errors in the first edition, the new edition has been expanded by about 70 pages, covering several additional interesting topics such as the Lovász sieve, associative block designs and list colorings of graphs. Also, quite a few new problems have been added. Summing up, I find this book as fascinating as ever; once again, it is highly recommended reading.
0 references
