On a theorem of Lovász that (, H) determines the isomorphism type of H

DOI10.1145/3448641zbMATH Open1506.05142OpenAlexW3164783462MaRDI QIDQ5065633FDOQ5065633

Jin-Yi Cai, Artem Govorov

Publication date: 22 March 2022

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3448641

Recommendations

• Graph homomorphisms with complex values: a dichotomy theorem (extended abstract)
• A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
• On recognizing graphs by numbers of homomorphisms
• Counting homomorphisms and partition functions
• Graph homomorphisms with complex values: a dichotomy theorem

zbMATH Keywords

tensorsgraph homomorphismpartition functioncomplexity dichotomyconnection matrices

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (2)

• Perfect matchings, rank of connection tensors and graph homomorphisms
• Title not available (Why is that?)

This page was built for publication: On a theorem of Lovász that \((\cdot, H)\) determines the isomorphism type of \(H\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065633)