14 citations · 26 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014★ 1 cited
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permuta…
math.CO2014★ 9 cited
Infinite dimensional finitely forcible graphon
Roman Glebov, Tereza Klimosova, Daniel Kral
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of p…