7 citations · 8 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
quant-ph2019
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mančinska, David E. Roberson
Over 50 years ago, Lovász proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--32…
math.CO2019
Algebras, graphs and thetas
Marcel K. de Carli Silva, Gabriel Coutinho, Chris Godsil +1
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations…