Bipartite Graphs and their Applications: Cambridge Tracts in Mathematics, cartea 131
Autor Armen S. Asratian, Tristan M. J. Denley, Roland Häggkvisten Limba Engleză Paperback – 11 iun 2008
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 428.97 lei 6-8 săpt. | |
Cambridge University Press – 11 iun 2008 | 428.97 lei 6-8 săpt. | |
Hardback (1) | 777.16 lei 6-8 săpt. | |
Cambridge University Press – 12 iul 1998 | 777.16 lei 6-8 săpt. |
Din seria Cambridge Tracts in Mathematics
- 8% Preț: 452.91 lei
- 9% Preț: 763.72 lei
- 9% Preț: 808.04 lei
- 8% Preț: 445.10 lei
- 9% Preț: 661.68 lei
- Preț: 184.19 lei
- Preț: 184.02 lei
- 14% Preț: 761.34 lei
- Preț: 184.39 lei
- Preț: 183.82 lei
- Preț: 183.65 lei
- Preț: 184.19 lei
- Preț: 301.60 lei
- 14% Preț: 687.34 lei
- Preț: 184.39 lei
- Preț: 183.82 lei
- Preț: 184.19 lei
- Preț: 183.82 lei
- Preț: 212.93 lei
- Preț: 213.09 lei
- Preț: 184.02 lei
- Preț: 184.78 lei
- Preț: 183.28 lei
- Preț: 183.82 lei
- Preț: 379.77 lei
- Preț: 376.50 lei
- Preț: 447.15 lei
- 11% Preț: 567.13 lei
- 11% Preț: 439.67 lei
- 11% Preț: 407.70 lei
- Preț: 441.68 lei
- Preț: 444.32 lei
- Preț: 416.82 lei
- Preț: 441.68 lei
- Preț: 428.01 lei
- 11% Preț: 502.07 lei
- 14% Preț: 771.31 lei
- Preț: 301.37 lei
Preț: 428.97 lei
Nou
Puncte Express: 643
Preț estimativ în valută:
82.13€ • 85.53$ • 68.15£
82.13€ • 85.53$ • 68.15£
Carte tipărită la comandă
Livrare economică 14-28 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780521065122
ISBN-10: 0521065127
Pagini: 272
Dimensiuni: 150 x 229 x 15 mm
Greutate: 0.4 kg
Ediția:1
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Mathematics
Locul publicării:Cambridge, United Kingdom
ISBN-10: 0521065127
Pagini: 272
Dimensiuni: 150 x 229 x 15 mm
Greutate: 0.4 kg
Ediția:1
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Mathematics
Locul publicării:Cambridge, United Kingdom
Cuprins
1. Basic concepts; 2. Biparticity; 3. Metric properties; 4. Connectivity; 5. Maximum matchings; 6. Expanding properties; 7. Subgraphs with restricted degrees; 8. Edge colourings; 9. Doubly stochastic matrices and bipartite graphs; 10. Coverings; 11. Some combinatorial applications; 12. Bipartite subgraphs of arbitrary graphs.
Recenzii
"...excellent monograph...This is an invaluable book and an indispensable resource for any serious student of graph theory." Mathematics of Computing
"...the treatment of topics is clear and self-contained and shows considerable design, work, and thought...as a volume in the series Cambridge Tracts in Mathematics, this book has the mandate to 'take up a single thread in a wide subject and follow its ramifications, thus throwing light on its various aspects.' This book does that, beautifully." Siam Review
"...the treatment of topics is clear and self-contained and shows considerable design, work, and thought...as a volume in the series Cambridge Tracts in Mathematics, this book has the mandate to 'take up a single thread in a wide subject and follow its ramifications, thus throwing light on its various aspects.' This book does that, beautifully." Siam Review
Descriere
This book treats the fundamental mathematical properties that hold for a family of Gaussian random variables.