20 citations · 61 across the 13 of their papers we have counts for
14 papers · 1 filter
Random homomorphisms into the orthogonality graph
Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequen…
Locally common graphs
Endre Csóka, Tamás Hubai, László Lovász
Goodman proved that the sum of the number of triangles in a graph on nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a…
Compact graphings
László Lovász
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a proced…
Finitely forcible graphons with an almost arbitrary structure
Daniel Kral, László Miklós Lovász, Jonathan A. Noel +1
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities,…
Hyperfinite graphings and combinatorial optimization
László Lovász
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invarian…
Nullspace embeddings for outerplanar graphs
László Lovász, Alexander Schrijver
We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph $G=(V,…