How many F's are there in G? - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2011

How many F's are there in G?

Résumé

We prove that the asymptotic logarithmic density of copies of a graph $F$ in the graphs of a nowhere dense class $\mathcal C$ is integral and we determine the range of its possible values. This leads to a generalization of the Trichotomy theorem \cite{ND_characterization} and to a notion of degree of freedom of a graph $F$ in a class $\mathcal C$. This provides yet another formulation of the somewhere dense -- nowhere dense classification. We obtain a structural result about the asymptotic shape of graphs with given degree of freedom.

Dates et versions

hal-00656795 , version 1 (05-01-2012)

Identifiants

Citer

Jaroslav Nesetril, Patrice Ossona de Mendez. How many F's are there in G?. European Journal of Combinatorics, 2011, 32 (7), pp.1126-1141. ⟨10.1016/j.ejc.2011.03.007⟩. ⟨hal-00656795⟩

Collections

CNRS EHESS
83 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More