181 citations
- University of British ColumbiaCA4 papers
- University of California, BerkeleyUS4 papers
- Eindhoven University of TechnologyNL3 papers
- Hebrew University of JerusalemIL3 papers
- Courant Institute of Mathematical SciencesUS2 papers
- Microsoft Research (United Kingdom)GB2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- Australian National UniversityAU1 paper
- Board of the Swiss Federal Institutes of TechnologyCH1 paper
- Charles UniversityCZ1 paper
- Columbia UniversityUS1 paper
- Délégation Paris 6FR1 paper
5 papers · 1 filter
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…
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…
On Metric Ramsey-type Dichotomies
Yair Bartal, Nathan Linial, Manor Mendel +1
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of…
Dimers, Tilings and Trees
Richard Kenyon, Scott Sheffield
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; plana…