Edge coloring models and reflection positivity
From MaRDI portal
Abstract: Solving a conjecture of M. H. Freedman, L. Lov'asz and A. Schrijver we prove that a graph parameter is edge reflection positive and multiplicative if and only if it can be represented by an edge coloring model.
Recommendations
- A characterization of edge-reflection positive partition functions of vertex-coloring models
- Edge-reflection positivity and weighted graph homomorphisms
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Edge coloring models as singular vertex coloring models
- An application of matching theory of edge-colourings
Cites work
- scientific article; zbMATH DE number 47607 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1950436 (Why is no real title available?)
- Limits of dense graph sequences
- Reflection positivity, rank connectivity, and homomorphism of graphs
- The rank of connection matrices and the dimension of graph algebras
- Universal manifold pairings and positivity
Cited in
(33)- Graph invariants in the spin model
- On the existence of real R-matrices for virtual link invariants
- Partition functions from orthogonal and symplectic group invariants
- Zero-free regions of partition functions with applications to algorithms and graph limits
- Mixed partition functions and exponentially bounded edge-connection rank
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- On traces of tensor representations of diagrams
- On Lie algebra weight systems for 3-graphs
- Tensor subalgebras and first fundamental theorems in invariant theory
- Edge coloring models as singular vertex coloring models
- Dimer and fermionic formulations of a class of colouring problems
- On partition functions for 3-graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Graph parameters from symplectic group invariants
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
- Connection Matrices for MSOL-Definable Structural Invariants
- Tensor invariants for certain subgroups of the orthogonal group
- Characterizing partition functions of the vertex model
- The rank of edge connection matrices and the dimension of algebras of invariant tensors
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Edge-reflection positivity and weighted graph homomorphisms
- Characterizing partition functions of the edge-coloring model by rank growth
- A characterization of edge-reflection positive partition functions of vertex-coloring models
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Bipartite 3-regular counting problems with mixed signs
- Bipartite 3-regular counting problems with mixed signs
- Restricted Holant dichotomy on domains 3 and 4
- Restricted Holant dichotomy on domain sizes 3 and 4
- A combinatorial view of Holant problems on higher domains
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- Compact orbit spaces in Hilbert spaces and limits of edge-colouring models
- Connection matrices and Lie algebra weight systems for multiloop chord diagrams
- Dual graph homomorphism functions
This page was built for publication: Edge coloring models and reflection positivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594371)
