“This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. … There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter.
This course examines classical and modern developments in graph theory and additive combinatorics, with a focus on topics and themes that connect the two subjects.
Combinatorics is often described briefly as being about counting, and indeed counting is a large part of combinatorics.Graph theory is concerned with various types of networks, or really models of …
Combinatorics - Graph Theory, Counting, Probability: A graph G consists of a non-empty set of elements V (G) and a subset E (G) of the set of unordered pairs of distinct elements of V (G).
The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order.
nev All rights reserved Preface This manuscript is based on a set of lecture notes that I prepared and used for teaching Combinatorics and Graph Theory 1 & 2 at the Faculty of Mathematics and Physics, Charles University, during the ac.
4 Applied Combinatorics by Alan Tucker is a good one. It's short, not hard to follow, a lot of problems to work through, and it's split into two sections: graph theory in section 1, and combinatorics (generating functions, counting techniques, etc) in section 2.
Perhaps the most famous problem in graph theory concerns map coloring: Given a map of some countries, how many colors are required to color the map so that countries sharing a border get fft colors?