Aspects of combinatorics : a wide-ranging introduction / Victor Bryant.
Editor: Cambridge : Cambridge University Press, 1993Descripción: viii, 266 p. : il. ; 25 cmISBN: 0521429978 (pb); 0521419743 (hc)Tema(s): Combinatorial analysisOtra clasificación: 05-01 (90C27) Recursos en línea: Publisher description1. The binomial coefficients2. How many trees?3. The marriage theorem4. Three basic principles5. Latin squares6. The first theorem of graph theory7. Edge-colourings8. Harems and tournaments9. Minimax theorems10. Recurrence11. Vertex-colourings12. Rook polynomials13. Planar graphs14. Map-colourings15. Designs and codes16. Ramsey theory.
| Item type | Home library | Shelving location | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Libros
|
Instituto de Matemática, CONICET-UNS | Libros ordenados por tema | 05 B915 (Browse shelf) | Available | A-6815 |
Browsing Instituto de Matemática, CONICET-UNS shelves, Shelving location: Libros ordenados por tema Close shelf browser
| 05 B741 Decompositions of graphs / | 05 B886 Introductory combinatorics / | 05 B886c Combinatorial matrix theory / | 05 B915 Aspects of combinatorics : | 05 B976 Finite graphs and networks : | 05 C183 Difference sets in elementary Abelian groups / | 05 C245 Examples and counterexamples in graph theory / |
Incluye referencias bibliográficas (p. [262]) e índice.
1. The binomial coefficients -- 2. How many trees? -- 3. The marriage theorem -- 4. Three basic principles -- 5. Latin squares -- 6. The first theorem of graph theory -- 7. Edge-colourings -- 8. Harems and tournaments -- 9. Minimax theorems -- 10. Recurrence -- 11. Vertex-colourings -- 12. Rook polynomials -- 13. Planar graphs -- 14. Map-colourings -- 15. Designs and codes -- 16. Ramsey theory.
MR, MR1213683
Click on an image to view it in the image viewer
There are no comments on this title.