2 papers
math.CO2018
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,…
cs.CG2017
A note on minimal dispersion of point sets in the unit cube
Jakub Sosnovec
We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real and an integer , let denote the minimum number of p…