Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation (Q6647718)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation |
scientific article; zbMATH DE number 7953328
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation |
scientific article; zbMATH DE number 7953328 |
Statements
Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation (English)
0 references
3 December 2024
0 references
counting logics
0 references
guarded logics
0 references
homomorphism counting
0 references
hypertree decompositions
0 references
hypergraphs
0 references
incidence graphs
0 references
quantum graphs
0 references
