10 citations · 11 across the 4 of their papers we have counts for
4 papers
Contractors and connectors of graph algebras
Laszlo Lovasz, Balazs Szegedy
We study generalizations of the "contraction-deletion" relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in…
Edge coloring models and reflection positivity
Balazs Szegedy
Solving a conjecture of M. H. Freedman, L. Lovász and A. Schrijver we prove that a graph parameter is edge reflection positive and multiplicative if and only if it can be represent…
Coverings of abelian groups and vector spaces
Balazs Szegedy
We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of…
Limits of dense graph sequences
Laszlo Lovasz, Balazs Szegedy
We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``lim…