20 citations · 24 across the 3 of their papers we have counts for
3 papers
math.CO2011
Characterizing partition functions of the vertex model
Jan Draisma, Dion Gijswijt, László Lovász +2
We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We…
math.CO2010★ 4 cited
The graph theoretic moment problem
László Lovász, Balázs Szegedy
We study an analogue of the classical moment problem in the framework where moments are indexed by graphs instead of natural numbers. We study limit objects of graph sequences wher…
math.CO2010★ 20 cited
Limits of compact decorated graphs
László Lovász, Balázs Szegedy
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit…