3 papers
cs.DM2026
On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
Marek Äerný
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the…
cs.CC2025
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
Marek Äerný, Tim Seppelt
Two graphs and are homomorphism indistinguishable over a graph class if they admit the same number of homomorphisms from every graph . Many…
cs.LG2025
Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
Marek Äerný
Message-passing graph neural networks (MPGNNs) dominate modern graph learning. Typical efforts enhance MPGNN's expressive power by enriching the adjacency-based aggregation. In con…