Some general results in combinatorial enumeration

Abstract

This is a survey on general results in combinatorial enumeration. Topics covered: hereditary properties of graphs, permutations etc.; counting lattice points; growth of context-free languages; counting regular graphs; counting MSOL-definable structures.

Keywords

• general results
• combinatorial enumeration