Semidefinite Functions on Categories
László Lovász, Alexander Schrijver · The Electronic Journal of Combinatorics · 2009
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009
Abstract
Freedman, Lovász and Schrijver characterized graph parameters that can be represented as the (weighted) number of homomorphisms into a fixed graph. Several extensions of this result have been proved. We use the framework of categories to prove a general theorem of this kind. Similarly as previous resuts, the characterization uses certain infinite matrices, called connection matrices, which are required to be positive semidefinite.
Open the resolved locator · 10.37236/80
Metadata licence: OpenAlex metadata (CC0)