Characterizing partition functions of the edge-coloring model by rank growth

DOI10.1016/j.jcta.2015.06.007zbMath1319.05108arXiv1211.3561OpenAlexW1605522743MaRDI QIDQ490913

Alexander Schrijver

Publication date: 21 August 2015

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

partition functionsymmetric grouprepresentation theorygraph parametersedge-coloring modelconnection matrix

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Symmetric groups (20B30)

Related Items (4)

Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ Graph parameters from symplectic group invariants ⋮ Partition functions from orthogonal and symplectic group invariants ⋮ Mixed partition functions and exponentially bounded edge-connection rank

Cites Work

• Characterizing partition functions of the vertex model
• Graph invariants related to statistical mechanical models: Examples and problems
• Graph invariants in the spin model
• Holographic algorithms by Fibonacci gates
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Edge coloring models and reflection positivity
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing partition functions of the edge-coloring model by rank growth