Contractors and connectors of graph algebras

DOI10.1002/jgt.20343zbMath1189.05115arXivmath/0505162MaRDI 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 homomorphism; Tutte polynomial; graph algebra; connector; contractor; contraction-deletion; homomorphism functions

Mathematics Subject Classification ID

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

05C76: Graph operations (line graphs, products, etc.)

Related Items

Graph parameters from symplectic group invariants, The large deviation principle for the Erdős-Rényi random graph, Finitely forcible graphons, Edge cut splitting formulas for Tutte-Grothendieck invariants, Estimating and understanding exponential random graph models, On the number of \(B\)-flows of a graph, Unnamed Item, Contractors for flows, On recognizing graphs by numbers of homomorphisms

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