|
|
 |
| Результат поиска |
Поиск книг, содержащих: Ramsey theory
| Книга | Страницы для поиска | | Kedlaya K.S., Poonen B., Vakil R. — The William Lowell Putnam Mathematical Competition 1985–2000: Problems, Solutions, and Commentary | 219 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 2184 | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 311 | | Diestel R. — Graph Theory | 189—208 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 2184 | | Brin M., Stuck G. — Introdution to dynamical system | 48 | | Diestel R. — Graph theory | 251—273 | | Mill J.V. — The Infinite-Dimensional Topology of Function Spaces | 238, 240 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 191. | | Kushilevitz E., Nisan N. — Communication Complexity | 87 | | Molloy M.S., Reed B. — Graph Colouring and the Probabilistic Method | 34 | | Tucker А. — Applied Combinatorics | 53, 419 | | Grünbaum B. — Convex Polytopes | 7b, 30b | | Rota G.-C. — Studies in combinatorics (MAA Studies in Mathematics, volume 17) | 80 | | Tucker A. — Applied Combinatorics | 53, 419 | | Diestel R. — Graph Theory | 189, 208 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 897 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 897 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 305 | | Dineen S. — Complex Analysis of Infinite Dimensional Spaces | 139 | | Krantz S. — Mathematical apocrypha redux | 44 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 305 | | Krantz S. — Mathematical Apocrypha Redux: More Stories and Anecdotes of Mathematicians and the Mathematical (Spectrum) (Spectrum) | 44 |
|
|
|
|
О проекте