Дискретная математика на английском языке. Состоит из 14 глав.
Там есть большое количество заданий и к ним собственно ответы
0-Yes, There are Proofs! , 1-Logic, 2-Set and Relations, 3-functions, 4-The Integers, 5-Induction and Recursion, 6-Principles of Counting, 7-Permutations and Combinations, 8-Algoritms, 9-Graphs, 10-Path and Circuits, 11-Applications of Paths and Circuits, 12-Trees, 13-Planar Graphs Colorings, 14-The Max Flow-Min Cut Theorem and Solutions(ответы).
Там есть большое количество заданий и к ним собственно ответы
0-Yes, There are Proofs! , 1-Logic, 2-Set and Relations, 3-functions, 4-The Integers, 5-Induction and Recursion, 6-Principles of Counting, 7-Permutations and Combinations, 8-Algoritms, 9-Graphs, 10-Path and Circuits, 11-Applications of Paths and Circuits, 12-Trees, 13-Planar Graphs Colorings, 14-The Max Flow-Min Cut Theorem and Solutions(ответы).