How many Fs are there in G?

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10104600" target="_blank" >RIV/00216208:11320/11:10104600 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2011.03.007" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2011.03.007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2011.03.007" target="_blank" >10.1016/j.ejc.2011.03.007</a>

Result language
angličtina
Original language name
How many Fs are there in G?
Original language description
We prove that the asymptotic logarithmic density of copies of a graph F in the graphs of a nowhere dense class C is integral and we determine the range of its possible values. This leads to a generalization of the trichotomy theorem of Nesetril and Ossona de Mendez (2011) [8] and to a notion of the degree of freedom of a graph F in a class C. This provides yet another formulation of the somewhere dense-nowhere dense classification. We obtain a structural result concerning the asymptotic shape of graphswith given degree of freedom.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)