Model Theoretic Methods in Finite Combinatorics

Over the last 20 years, various new connections between model theory and finite combinatorics have emerged. This volume highlights some of the main results, techniques, and research directions of the area. Topics covered include developments on 0-1 laws and their variations, counting functions defined by homomorphisms and graph polynomials and their relation to logic, recurrences and spectra, the logical complexity of graphs, algorithmic meta theorems based on logic, and logical aspects of Ramsey theory.