Cargando…
A course in combinatorics /
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro |
| Lenguaje: | English |
| Publicado: |
Cambridge, U.K. ; New York :
Cambridge University Press,
2001.
|
| Edición: | Second edition |
| Materias: | |
| Acceso en línea: | Sample text Publisher description Table of contents |
MARC
| LEADER | 00000cam a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | ocm48531921 | ||
| 003 | OCoLC | ||
| 005 | 20221006093408.0 | ||
| 008 | 140328s2001 enka b 001 0 eng | ||
| 010 | |a 2002276170 | ||
| 035 | |a (Sirsi) i9780521803403 | ||
| 040 | |a DLC |b eng |c DLC |d UV# | ||
| 015 | |a GBA1-69214 | ||
| 020 | |a 0521803403 | ||
| 020 | |a 9780521803403 | ||
| 020 | |a 0521006015 | ||
| 020 | |a 9780521006019 | ||
| 035 | |a (OCoLC)48531921 |z (OCoLC)59377683 | ||
| 050 | 4 | |a QA164 |b L56 2001 | |
| 082 | 0 | 0 | |a 511/.6 |2 21 |
| 084 | |a 31.12 |2 bcl | ||
| 084 | |a SK 170 |2 rvk | ||
| 100 | 1 | |a Lint, Jacobus Hendricus van, |d 1932- | |
| 245 | 1 | 2 | |a A course in combinatorics / |c J.H. van Lint and R.M. Wilson. |
| 250 | |a Second edition | ||
| 260 | |a Cambridge, U.K. ; |a New York : |b Cambridge University Press, |c 2001. | ||
| 300 | |a xiv, 602 páginas : |b ilustraciones ; |c 26 cm. | ||
| 504 | |a Incluye bibliografías. | ||
| 505 | 0 | 0 | |g 1. |t Graphs |g 1 -- |g 2. |t Trees |g 12 -- |g 3. |t Colorings of graphs and Ramsey's theorem |g 24 -- |g 4. |t Turan's theorem and extremal graphs |g 37 -- |g 5. |t Systems of distinct representatives |g 43 -- |g 6. |t Dilworth's theorem and extremal set theory |g 53 -- |g 7. |t Flows in networks |g 61 -- |g 8. |t De Bruijn sequences |g 71 -- |g 9. |t Two (0, 1 *) problems: addressing for graphs and a hash-coding scheme |g 77 -- |g 10. |t The principle of inclusion and exclusion; inversion formulae |g 89 -- |g 11. |t Permanents |g 98 -- |g 12. |t The Van der Waerden conjecture |g 110 -- |g 13. |t Elementary counting; Stirling numbers |g 119 -- |g 14. |t Recursions and generating functions |g 129 -- |g 15. |t Partitions |g 152 -- |g 16. |t (0, 1)-Matrices |g 169 -- |g 17. |t Latin squares |g 182 -- |g 18. |t Hadamard matrices, Reed--Muller codes |g 199 -- |g 19. |t Designs |g 215 -- |g 20. |t Codes and designs |g 244 -- |g 21. |t Strongly regular graphs and partial geometries |g 261 -- |g 22. |t Orthogonal Latin squares |g 283 -- |g 23. |t Projective and combinatorial geometries |g 303 -- |g 24. |t Gaussian numbers and q-analogues |g 325 -- |g 25. |t Lattices and Mobius inversion |g 333 -- |g 26. |t Combinatorial designs and projective geometries |g 351 -- |g 27. |t Difference sets and automorphisms |g 369 -- |g 28. |t Difference sets and the group ring |g 383 -- |g 29. |t Codes and symmetric designs |g 396 -- |g 30. |t Association schemes |g 405 -- |g 31. |t (More) algebraic techniques in graph theory |g 432 -- |g 32. |t Graph connectivity |g 451 -- |g 33. |t Planarity and coloring |g 459 -- |g 34. |t Whitney Duality |g 472 -- |g 35. |t Embeddings of graphs on surfaces |g 491 -- |g 36. |t Electrical networks and squared squares |g 507 -- |g 37. |t Polya theory of counting |g 522 -- |g 38. |t Baranyai's theorem |g 536 -- |g Appendix 1. |t Hints and comments on problems |g 542 -- |g Appendix 2. |t Formal power series |g 578. |
| 650 | 7 | |a Análisis combinatorio |9 2620 | |
| 700 | 1 | |a Wilson, R. M. |q (Richard Michael), |d 1945- | |
| 856 | 4 | 1 | |3 Sample text |u http://catdir.loc.gov/catdir/samples/cam034/2002276170.html |
| 856 | 4 | 2 | |3 Publisher description |u http://catdir.loc.gov/catdir/description/cam022/2002276170.html |
| 856 | 4 | 1 | |3 Table of contents |u http://catdir.loc.gov/catdir/toc/cam026/2002276170.html |
| 901 | |a Z0 |b UV# | ||
| 596 | |a 2 | ||
| 942 | |c LIBRO | ||
| 999 | |c 274691 |d 274691 | ||