An Introduction to Combinatorics and Graph Theory
by David Guichard
Publisher: Whitman College 2017
Number of pages: 153
This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
Home page url
Download or read it online for free here:
by Philippe Flajolet, Robert Sedgewick - Cambridge University Press
Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.
by Federico Ardila - arXiv
The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
by Richard P. Stanley - MIT
The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.
by Klaus Truemper - Leibniz
Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. The exposition is clear and simple.