Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.