Communication Dans Un Congrès Année : 2009

Counting Homomorphisms to Sparse Graphs

Résumé

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

Dates et versions

hal-00429958 , version 1 (05-11-2009)

Identifiants

Citer

Jaroslav Nesetril, Patrice Ossona de Mendez. Counting Homomorphisms to Sparse Graphs. European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Sep 2009, Bordeaux, France. pp.393-397, ⟨10.1016/j.endm.2009.07.065⟩. ⟨hal-00429958⟩

Collections

104 Consultations
0 Téléchargements

Altmetric

Partager

  • More