Vai al contenuto principale della pagina
Autore: | Matoušek Jiří <1963-> |
Titolo: | Invitation to discrete mathematics [[electronic resource] /] / Jiří Matoušek, Jaroslav Nešetřil |
Pubblicazione: | Oxford ; ; New York, : Oxford University Press, 2009 |
Edizione: | 2nd ed. |
Descrizione fisica: | 1 online resource (462 p.) |
Disciplina: | 510 |
Soggetto topico: | Mathematics |
Computer science - Mathematics | |
Altri autori: | NešetřilJaroslav |
Note generali: | Description based upon print version of record. |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Contents; 1 Introduction and basic concepts; 2 Orderings; 3 Combinatorial counting; 4 Graphs: an introduction; 5 Trees; 6 Drawing graphs in the plane; 7 Double-counting; 8 The number of spanning trees; 9 Finite projective planes; 10 Probability and probabilistic proofs; 11 Order from disorder: Ramsey's theorem; 12 Generating functions; 13 Applications of linear algebra; Appendix: Prerequisites from algebra; Bibliography; Hints to selected exercises; Index |
Sommario/riassunto: | A clear and self-contained introduction to discrete mathematics for undergraduates and early graduates. - ;This second edition of Invitation to Discrete Mathematics is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and. having fun at that). By focu |
Titolo autorizzato: | Invitation to discrete mathematics |
ISBN: | 1-383-03001-4 |
1-281-86568-0 | |
9786611865689 | |
0-19-152467-0 | |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910811001003321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |