Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.