12 citations · 50 across the 21 of their papers we have counts for
4 papers · 1 filter
Compactness and finite forcibility of graphons
Roman Glebov, Daniel Kral, Jan Volec
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons deter…
Finitely forcible graphons and permutons
Roman Glebov, Andrzej Grzesik, Tereza Klimosova +1
We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely…
Building spanning trees quickly in Maker-Breaker games
Dennis Clemens, Asaf Ferber, Roman Glebov +2
For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a…
A problem of Erdos and Sos on 3-graphs
Roman Glebov, Daniel Kral, Jan Volec
We show that for every positive epsilon there exist positive delta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with the property that every k-vertex subset, whe…