Title of article
Counting Homomorphisms to Sparse Graphs
Author/Authors
Ne?et?il، نويسنده , , Jaroslav and de Mendez، نويسنده , , Patrice Ossona de Mendez، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
393
To page
397
Abstract
We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it has application to complexity of Boolean queries.
Keywords
graph , Counting , Homomorphism , Tree-depth , Boolean query , nowhere dense class
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455161
Link To Document