Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Tim Seppelt

TL;DR
This paper explores how various graph equivalences can be characterized through homomorphism indistinguishability over minor-closed classes, linking logical, spectral, and quantum graph properties.
Contribution
It establishes that self-complementarity logics correspond to homomorphism indistinguishability over minor-closed classes and classifies finite classes with maximal homomorphism distinguishing properties.
Findings
Homomorphism indistinguishability characterizes many graph equivalences.
Self-complementarity logics relate to minor-closed graph classes.
Classification of finite homomorphism distinguishing closed classes.
Abstract
Two graphs and are homomorphism indistinguishable over a class of graphs if for all graphs the number of homomorphisms from to is equal to the number of homomorphisms from to . Many natural equivalence relations comparing graphs such as (quantum) isomorphism, spectral, and logical equivalences can be characterised as homomorphism indistinguishability relations over certain graph classes. Abstracting from the wealth of such instances, we show in this paper that equivalences w.r.t. any self-complementarity logic admitting a characterisation as homomorphism indistinguishability relation can be characterised by homomorphism indistinguishability over a minor-closed graph class. Self-complementarity is a mild property satisfied by most well-studied logics. This result follows from a correspondence between closure properties of a graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
