The rank of connection matrices and the dimension of graph algebras
From MaRDI portal
Publication:2493113
DOI10.1016/j.ejc.2005.04.012zbMath1088.05052arXivmath/0408232OpenAlexW1975568166MaRDI QIDQ2493113
Publication date: 9 June 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408232
Related Items
Perfect matchings, rank of connection tensors and graph homomorphisms, Graphon convergence of random cographs, The rank of edge connection matrices and the dimension of algebras of invariant tensors, Unnamed Item, Estimating and understanding exponential random graph models, The large deviation principle for the Erdős-Rényi random graph, Distinguishing graphs by their left and right homomorphism profiles, The automorphism group of a graphon, Generalized quasirandom graphs, Edge coloring models and reflection positivity, Contractors and connectors of graph algebras, Recurrence relations for graph polynomials on bi-iterative families of graphs, Matroid invariants and counting graph homomorphisms
Cites Work