Jirí Matousek received his PhD in Mathematics from the Charles University in Prague in 1990 and is now Professor of Computer Science at Charles University Prague. He has held several visiting positions at universities in the U.S., Germany, Switzerland, Japan, and other countries. Humboldt Research Fellow in 1992 (Free University Berlin). Prize for Young Mathematicians of the 2nd European Congress of Mathematics in Budapest in 1996, speaker at the ICM 1998.; Jaroslav Nesetril received his PhD from the Charles University in Prague in 1975 and is now Professor of Mathematics at Charles University Prague. He has held several visiting positions abroad (U.S.A., Canada, Germany). Currently he is the head of the Centre for Theoretical Computer Science (ITI) at Charles University and the director of the international center for Discrete Mathematics, Theoretical Computer Science and Their Applications (DIMATIA).
Preface to the second edition
Preface to the first edition
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
Bibliography
Hints to selected exercises
Index
