Sparse Combinatorial Structures: Classification and Applications

Jaroslav Nesetril (1) , Patrice Ossona de Mendez (2)

1 KAM - Department of Applied Mathematics (KAM)
2 CAMS - Centre d'Analyse et de Mathématique sociales

We present results of the recent research on sparse graphs and finite structures in the context of of contemporary combinatorics, graph theory, model theory and mathematical logic, complexity of algorithms and probability theory. The topics include: complexity of subgraph- and homomorphism- problems; model checking problems for first order formulas in special classes; property testing in sparse classes of structures. All these problems can be studied under the umbrella of classes of structures which are Nowhere Dense and in the context of Nowhere Dense -- Somewhere Dense dichotomy. This dichotomy presents the classification of the general classes of structures which proves to be very robust and stable as it can be defined alternatively by most combinatorial extremal invariants as well as by algorithmic and logical terms. We give examples from logic, geometry and extremal graph theory. Finally we characterize the existence of all restricted dualities in terms of limit objects defined on the homomorphism order of graphs.

Domaines: Combinatoire [math.CO]

Jaroslav Nesetril, Patrice Ossona de Mendez. Sparse Combinatorial Structures: Classification and Applications. International Congress of Mathematicians, Aug 2010, Hyderabad, India. pp.2502-2529. ⟨hal-00535086⟩