A Course in Combinatorics
Autor J. H. van Lint, R. M. Wilsonen Limba Engleză Paperback – 21 noi 2001
Preț: 668.43 lei
Preț vechi: 751.04 lei
-11% Nou
Puncte Express: 1003
Preț estimativ în valută:
127.94€ • 133.06$ • 107.21£
127.94€ • 133.06$ • 107.21£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780521006019
ISBN-10: 0521006015
Pagini: 620
Ilustrații: 66 b/w illus.
Dimensiuni: 170 x 244 x 33 mm
Greutate: 1.02 kg
Ediția:Revizuită
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
ISBN-10: 0521006015
Pagini: 620
Ilustrații: 66 b/w illus.
Dimensiuni: 170 x 244 x 33 mm
Greutate: 1.02 kg
Ediția:Revizuită
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
Cuprins
Preface; 1. Graphs; 2. Trees; 3. Colorings of graphs and Ramsey's theorem; 4. Turán's theorem and extremal graphs; 5. Systems of distinct representatives; 6. Dilworth's theorem and extremal set theory; 7. Flows in networks; 8. De Bruijn sequences; 9. The addressing problem for graphs; 10. The principle of inclusion and exclusion: inversion formulae; 11. Permanents; 12. The Van der Waerden conjecture; 13. Elementary counting: Stirling numbers; 14. Recursions and generating functions; 15. Partitions; 16. (0,1)-matrices; 17. Latin squares; 18. Hadamard matrices, Reed-Muller codes; 19. Designs; 20. Codes and designs; 21. Strongly regular graphs and partial geometries; 22. Orthogonal Latin squares; 23. Projective and combinatorial geometries; 24. Gaussian numbers and q-analogues; 25. Lattices and Möbius inversion; 26. Combinatorial designs and projective geometries; 27. Difference sets and automorphisms; 28. Difference sets and the group ring; 29. Codes and symmetric designs; 30. Association schemes; 31. Algebraic graph theory: eigenvalue techniques; 32. Graphs: planarity and duality; 33. Graphs: colorings and embeddings; 34. Electrical networks and squared squares; 35. Pólya theory of counting; 36. Baranyai's theorem; Appendices; Name index; Subject index.
Recenzii
'Both for the professional with a passing interest in combinatorics and for the students for whom it is primarily intended, this is a valuable book.' The Times Higher Education Supplement
'… it will no doubt become a standard choice among the many texts on combinatorics … fascinating … it is highly recommended reading.' Dieter Jungnichel, Zentralblatt MATH
'This well written textbook can be highly recommended to any student of combinatorics and, because of its breadth, has many new things to tell researchers in the field also.' EMS
'This is a fascinating introduction to almost all aspects of combinatorics. Plenty of interesting problems, concrete examples, useful notes and references complement the main text. This book can be highly recommended to everyone interested in combinatorics.' Monatshefe für Mathematik
'… becoming a modern classic … every good student should progress to this book at some stage: it is a wonderful source of elegant proofs and tantalising examples. No-one will find it easy, but every budding or established combinatorialist will be enriched by it … This text is unashamedly and impressively mathematical; it will challenge and inform every reader and is a very significant achievement.' The Mathematical Gazette
'… it will no doubt become a standard choice among the many texts on combinatorics … fascinating … it is highly recommended reading.' Dieter Jungnichel, Zentralblatt MATH
'This well written textbook can be highly recommended to any student of combinatorics and, because of its breadth, has many new things to tell researchers in the field also.' EMS
'This is a fascinating introduction to almost all aspects of combinatorics. Plenty of interesting problems, concrete examples, useful notes and references complement the main text. This book can be highly recommended to everyone interested in combinatorics.' Monatshefe für Mathematik
'… becoming a modern classic … every good student should progress to this book at some stage: it is a wonderful source of elegant proofs and tantalising examples. No-one will find it easy, but every budding or established combinatorialist will be enriched by it … This text is unashamedly and impressively mathematical; it will challenge and inform every reader and is a very significant achievement.' The Mathematical Gazette
Descriere
Second edition of a popular text which covers the whole field of combinatorics.