10 citations · 10 across the 5 of their papers we have counts for
7 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…
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…
The rank of connection matrices and the dimension of graph algebras
Laszlo Lovasz
Connection matrices were introduced by Freedman, Lovasz and Schrijver [1], who used them to characterize graph homomorphism functions. The goal of this note is to determine the exa…
Reflection positivity, rank connectivity, and homomorphism of graphs
M. Freedman, L. Lovasz, A. Schrijver
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflect…
Waiting for a bat to fly by (in polynomial time)
Itai Benjamini, Gady Kozma, Laszlo Lovasz +2
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans…
Determining the Genus of a Map by Local Observation of a Simple Random Process
Itai Benjamini, Laszlo Lovasz
Given a graph embedded in an orientable surface, a process consisting of random excitations and random node and face balancing is constructed and analyzed. It is shown that given a…