Tim Seppelt

activity

20192026

most citedWeisfeiler--Leman and Graph Spectra

4 citations · 8 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023★ 1 cited

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors

Tim Seppelt

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

math.CO2023★ 2 cited

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability

David E. Roberson, Tim Seppelt

We show that feasibility of the $t^{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability…

math.CO2021

Homomorphism Tensors and Linear Equations

Martin Grohe, Gaurav Rattan, Tim Seppelt

Lovász (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$ , the n…