Perfect matchings, rank of connection tensors and graph homomorphisms
type: Item
instance of: scholarly article
title: Perfect matchings, rank of connection tensors and graph homomorphisms
DOI: 10.1017/S0963548321000286
author: Jin-Yi Cai
author: Artem Govorov
published in: Combinatorics, Probability and Computing
publication date: 2023-03-31T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 7671058
zbMATH Keywords: perfect matchings
zbMATH Keywords: graph homomorphisms
zbMATH Keywords: graph parameters
zbMATH Keywords: tensor and tensor rank
zbMATH Keywords: graph algebras
Wikidata QID: Q114116553
MaRDI profile type: MaRDI publication profile
full work available at URL: s0963548321000286
OpenAlex ID: W3186782809
cites work: Theorems on the Partition Functions of the Heisenberg Ferromagnets
cites work: A New Holant Dichotomy Inspired by Quantum Computation
cites work: A complete dichotomy for complex-valued \(\textsc{Holant}^c\)
cites work: The six and eight-vertex models revisited
cites work: Counting graph homomorphisms
cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
cites work: The complexity of the counting constraint satisfaction problem
cites work: Automata, Languages and Programming
cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem
cites work: Complexity Dichotomies for Counting Problems
cites work: Complexity of counting CSP with complex weights
cites work: Graph homomorphisms with complex values: a dichotomy theorem
cites work: Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
cites work: Perfect matchings, rank of connection tensors and graph homomorphisms
cites work: On a theorem of Lovász that \((\cdot, H)\) determines the isomorphism type of \(H\)
cites work: Holant problems and counting CSP
cites work: Q3997571
cites work: Symmetric Tensors and Symmetric Tensor Rank
cites work: Lov\'asz Meets Weisfeiler and Leman
cites work: Characterizing partition functions of the vertex model
cites work: On recognizing graphs by numbers of homomorphisms
cites work: Q4952624
cites work: Corrigendum: The complexity of counting graph homomorphisms
cites work: An effective dichotomy for the counting constraint satisfaction problem
cites work: Reflection positivity, rank connectivity, and homomorphism of graphs
cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs
cites work: Quantum Groups in Two-Dimensional Physics
cites work: Counting homomorphisms and partition functions
cites work: The complexity of symmetric Boolean parity Holant problems
cites work: Q4828516
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Q5605168
cites work: Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
cites work: Operations with structures
cites work: The rank of connection matrices and the dimension of graph algebras
cites work: Large networks and graph limits
cites work: Graph parameters and semigroup functions
cites work: Generalized quasirandom graphs
cites work: Limits of dense graph sequences
cites work: Contractors and connectors of graph algebras
cites work: Tensor invariants for certain subgroups of the orthogonal group
cites work: Graph invariants in the spin model
cites work: Characterizing partition functions of the spin model by rank growth
cites work: Characterizing partition functions of the edge-coloring model by rank growth
cites work: Edge coloring models and reflection positivity
cites work: Edge coloring models as singular vertex coloring models
cites work: Dimer problem in statistical mechanics-an exact result
cites work: Q3188969
cites work: Holographic Algorithms
Recommended article: Perfect matchings, rank of connection tensors and graph homomorphisms
Recommended article: Reflection positivity, rank connectivity, and homomorphism of graphs
Recommended article: The rank of connection matrices and the dimension of graph algebras
Recommended article: On the theory of Pfaffian orientations. I: Perfect matchings and permanents
Recommended article: On counting perfect matchings in general graphs
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7671058