Tim Seppelt

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Topological and Geometric Perspectives on Homomorphism Indistinguishability

Josse van Dobben de Bruyn, Jérémie Marquès, David E. Roberson +3

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $F$ if, for every graph $F \in F$ , the number of homomorphisms from $F$ to $G$ is e…

math.CO2026

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs

Daniel Neuen, Tim Seppelt

Lovász (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of…