Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics| as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics| symmetric functions| Schubert calculus / Combinatorial Hopf algebras| cluster algebras| Lie algebras| root systems| Coxeter groups / Discrete geometry| tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory| graph minors| graph sparsity| decompositions and colorings / Planar graphs and topological graph theory| geometric representations of graphs / Directed graphs| posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs| extremal graph theory / Matroids| oriented matroids| matroid minors / Algorithmic approaches
数据整理自公开网络的投稿反馈，仅供参考。
