11 citations · 13 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021★ 1 cited
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…
math.CO2014★ 11 cited
Multigraph limits, unbounded kernels, and Banach space decorated graphs
Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional ana…