Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation

DOI10.4230/LIPICS.MFCS.2023.79MaRDI QIDQ6647718

Benjamin Scheidt, Nicole Schweikardt

Publication date: 3 December 2024

zbMATH Keywords

incidence graphshypergraphsquantum graphshypertree decompositionscounting logicshomomorphism countingguarded logics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647718)