Contractors and connectors of graph algebras

DOI10.1002/jgt.20343zbMath1189.05115arXivmath/0505162OpenAlexW2949221968MaRDI QIDQ3605157

Balázs Szegedy, László Lovász

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505162

zbMATH Keywords

graph homomorphismTutte polynomialgraph algebraconnectorcontractorcontraction-deletionhomomorphism functions

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Perfect matchings, rank of connection tensors and graph homomorphisms, Graph parameters from symplectic group invariants, Edge cut splitting formulas for Tutte-Grothendieck invariants, Graphon convergence of random cographs, Estimating and understanding exponential random graph models, The large deviation principle for the Erdős-Rényi random graph, Local WL invariance and hidden shades of regularity, Unnamed Item, Finitely forcible graphons, On recognizing graphs by numbers of homomorphisms, On the number of \(B\)-flows of a graph, Contractors for flows

Cites Work

• Limits of dense graph sequences
• Moments of two-variable functions and the uniqueness of graph limits
• Generalized quasirandom graphs
• The rank of connection matrices and the dimension of graph algebras
• Reflection positivity, rank connectivity, and homomorphism of graphs