10 citations · 16 across the 5 of their papers we have counts for
5 papers · 1 filter
Graph limits: An alternative approach to s-graphons
Martin Doležal
We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to th…
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
Martin Doležal, Jan Hladký, Jan Kolář +3
Given a measurable set we consider the "large-distance graph" , on the ground set , in which each pair of points from whose distance is…
Cut-norm and entropy minimization over weak* limits
Martin Dolezal, Jan Hladky
We prove that the accumulation points of a sequence of graphs with respect to the cut-distance are exactly the weak limit points of subsequences of the adj…
Matching polytons
Martin Dolezal, Jan Hladky
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding noti…
Cliques in dense inhomogeneous random graphs
Martin Doležal, Jan Hladký, András Máthé
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…