10 citations · 11 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2005
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…
math.CO2005
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…
math.CO2004★ 10 cited
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…