The rank of connection matrices and the dimension of graph algebras

22Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Connection matrices were introduced in [M. Freedman, L. Lovász, A. Schrijver, Reflection positivity, rank connectivity, and homomorphism of graphs (MSR Tech Report # MSR-TR-2004-41) ftp://ftp.research.microsoft.com/pub/tr/TR-2004-41.pdf], where they were used to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in terms of the dimension of graph algebras, also introduced in the same paper. Yet another version proves that if two k-tuples of nodes behave in the same way from the point of view of graph homomorphisms, then they are equivalent under the automorphism group. © 2005 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Lovász, L. (2006). The rank of connection matrices and the dimension of graph algebras. European Journal of Combinatorics, 27(6), 962–970. https://doi.org/10.1016/j.ejc.2005.04.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free