Abstract
Graph homomorphism has been an important research topic since its introduction [20]. Stated in the language of binary relational structures in that paper [20], Lovász proved a fundamental theorem that, for a graph H given by its 0-1 valued adjacency matrix, the graph homomorphism function G ↦ hom(G, H) determines the isomorphism type of H. In the past 50 years, various extensions have been proved by many researchers [1, 15, 21, 24, 26]. These extend the basic 0-1 case to admit vertex and edge weights; but these extensions all have some restrictions such as all vertex weights must be positive. In this article, we prove a general form of this theorem where H can have arbitrary vertex and edge weights. A noteworthy aspect is that we prove this by a surprisingly simple and unified argument. This bypasses various technical obstacles and unifies and extends all previous known versions of this theorem on graphs. The constructive proof of our theorem can be used to make various complexity dichotomy theorems for graph homomorphism effective in the following sense: it provides an algorithm that for any H either outputs a P-time algorithm solving hom(&sdot, H) or a P-time reduction from a canonical #P-hard problem to hom(&sdot, H).
- C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi. 2008. Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Adv. Math. 219, 6 (2008), 1801–1851.Google Scholar
Cross Ref
- A. Bulatov and M. Grohe. 2005. The complexity of partition functions. Theor. Comput. Sci. 348, 2-3 (2005), 148–186. A preliminary version appeared in ICALP 2004: 294–306.Google Scholar
Digital Library
- J.-Y. Cai and X. Chen. 2017. Complexity Dichotomies for Counting Problems. Vol. 1: Boolean Domain. Cambridge University Press. DOI:https://doi.org/10.1017/9781107477063Google Scholar
- J.-Y. Cai and X. Chen. 2019. A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. Comput. Complexity 28, 3 (2019), 345–408.Google Scholar
Digital Library
- J.-Y. Cai, X. Chen, and P. Lu. 2013. Graph homomorphisms with complex values: A dichotomy theorem. SIAM J. Comput. 42, 3 (2013), 924–1029.Google Scholar
Digital Library
- J.-Y. Cai, Z. Fu, and S. Shao. 2020. Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS. Inf. Comput. 275 (2020), 104589. DOI:https://doi.org/10.1016/j.ic.2020.104589Google Scholar
Cross Ref
- J.-Y. Cai, M. Fürer, and N. Immerman. 1992. An optimal lower bound on the number of variables for graph identifications. Combinatorica 12, 4 (1992), 389–410.Google Scholar
Cross Ref
- J.-Y. Cai and A. Govorov. 2019. Perfect matchings, rank of connection tensors and graph homomorphisms. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19). 476–495.Google Scholar
- J.-Y. Cai and A. Govorov. 2020. On a theorem of Lovász that hom(&sdot, H) determines the isomorphism type of . In Proceedings of the 11th Innovations in Theoretical Computer Science (ITCS’20). 17:1–17:15.Google Scholar
- H. Dell, M. Grohe, and G. Rattan. 2018. Lovász meets Weisfeiler and Leman. In Proceedings of the 45th International Colloquium on Automata, Languages and Programming (ICALP’18). 40:1–40:14.Google Scholar
- Z. Dvořák. 2010. On recognizing graphs by numbers of homomorphisms. J. Graph Theory 64, 4 (2010), 330–342.Google Scholar
Cross Ref
- M. E. Dyer, L. A. Goldberg, and M. Paterson. 2007. On counting homomorphisms to directed acyclic graphs. J. ACM 54, 6 (2007), 27.Google Scholar
Digital Library
- M. E. Dyer and C. S. Greenhill. 2000. The complexity of counting graph homomorphisms. Random Struct. Algorithms 17, 3--4 (2000), 260–289. A preliminary version appeared in SODA 2000: 246–255.Google Scholar
Digital Library
- M. E. Dyer and C. S. Greenhill. 2004. Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25, 3 (2004), 346–352.Google Scholar
Digital Library
- M. Freedman, L. Lovász, and A. Schrijver. 2007. Reflection positivity, rank connectivity, and homomorphism of graphs. J. Amer. Math. Soc. 20, 1 (2007), 37–51.Google Scholar
Cross Ref
- L. A. Goldberg, M. Grohe, M. Jerrum, and M. Thurley. 2010. A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput. 39, 7 (2010), 3336–3402.Google Scholar
Digital Library
- A. Goodall, G. Regts, and L. Vena. 2016. Matroid invariants and counting graph homomorphisms. Linear Algebra Appl. 494 (2016), 263–273.Google Scholar
Cross Ref
- M. Grohe and M. Thurley. 2011. Counting homomorphisms and partition functions. In Model Theoretic Methods in Finite Combinatorics (Contemporary Mathematics), M. Grohe and J. Makowsky (Eds.), Vol. 558. American Mathematical Society, 243–292.Google Scholar
- P. Hell and J. Nešetřil. 2004. Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and its Applications, Vol. 28. Oxford University Press.Google Scholar
- L. Lovász. 1967. Operations with structures. Acta Math. Hungar. 18, 3--4 (1967), 321–328.Google Scholar
Cross Ref
- L. Lovász. 2006. The rank of connection matrices and the dimension of graph algebras. Eur. J. Comb. 27, 6 (2006), 962–970.Google Scholar
Digital Library
- L. Lovász. 2013. On the dimension of graph algebras for homomorphism functions. Retrieved from on April 25, 2021 https://web.cs.elte.hu/∼lovasz/book/homnotes-6-4-1.pdf.Google Scholar
- L. Lovász and V. T. Sós. 2008. Generalized quasirandom graphs. J. Comb. Theory Ser. B 98, 1 (2008), 146–163.Google Scholar
Digital Library
- L. Lovász and B. Szegedy. 2009. Contractors and connectors of graph algebras. J. Graph Theory 60, 1 (2009), 11–30.Google Scholar
Digital Library
- G. Regts. 2013. Graph Parameters and Invariants of the Orthogonal Group. Ph.D. Dissertation. Universiteit van Amsterdam.Google Scholar
- A. Schrijver. 2009. Graph invariants in the spin model. J. Comb. Theory Ser. B 99, 2 (2009), 502–511.Google Scholar
Digital Library
- A. Schrijver. 2013. Characterizing partition functions of the spin model by rank growth. Ind. Math. 24, 4 (2013), 1018–1023.Google Scholar
Cross Ref
- B. Szegedy. 2007. Edge coloring models and reflection positivity. J. Amer. Math. Soc. 20, 4 (2007), 969–988.Google Scholar
Cross Ref
- M. Thurley. 2009. The Complexity of Partition Functions. Ph.D. Dissertation. Humboldt Universität zu Berlin.Google Scholar
- L. G. Valiant. 2008. Holographic algorithms. SIAM J. Comput. 37, 5 (2008), 1565–1594.Google Scholar
Digital Library
Index Terms
On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H
Recommendations
Maximizing H-Colorings of Connected Graphs with Fixed Minimum Degree
For graphs G and H, an H-coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H, which connected n-vertex graph with minimum degree ï ź ...
Partitioning H-free graphs of bounded diameter
AbstractA natural way of increasing our understanding of NP-complete graph problems is to restrict the input to a special graph class. Classes of H-free graphs, that is, graphs that do not contain some graph H as an induced subgraph, have ...
List H-Coloring a Graph by Removing Few Vertices
In the deletion version of the list homomorphism problem, we are given graphs G and H, a list $$L(v)\subseteq V(H)$$L(v)⊆V(H) for each vertex $$v\in V(G)$$vźV(G), and an integer k. The task is to decide whether there exists a set $$W \subseteq V(G)$$W⊆V(...






Comments