5 citations · 9 across the 4 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 4 cited
Cut distance identifying graphon parameters over weak* limits
Martin Doležal, Jan Grebík, Jan Hladký +2
The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of -functi…
math.CO2018★ 5 cited
Relating the cut distance and the weak* topology for graphons
Martin Doležal, Jan Grebík, Jan Hladký +2
The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $…
math.CA2018
The de Bruijn-Erdős theorem from a Hausdorff measure point of view
Martin Doležal, Themis Mitsis, Christos Pelekis
Motivated by a well-known result in extremal set theory, due to Nicolaas Govert de Bruijn and Paul Erdős, we consider curves in the unit -cube of the form \[ A=\{(x,f_…