194 citations · 2.2k across the 69 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
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…
math.CO2019★ 10 cited
A limit theorem for small cliques in inhomogeneous random graphs
Jan Hladky, Christos Pelekis, Matas Sileikis
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erdős--Rényi random graph, called -random graphs. We prove, via…