10 citations · 16 across the 5 of their papers we have counts for
10 papers
A nonmicroscopic set with only microscopic compact subsets
Martin Doležal, Václav Vlasák
We construct a nonmicroscopic subset of the real line all of whose compact subsets are microscopic, answering a question of Zindulka and Nowakowski. We first obtain such a se…
Politics in Games -- An Overview and Classification
Lisa Gutwenger, Stephan Keller, Martin Dolezal +4
The representation of politics in media influences societal perceptions and attitudes. Video games, as a pervasive form of media, contribute significantly to this phenomenon. In th…
Graph limits: An alternative approach to s-graphons
Martin Doležal
We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to th…
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…
Cut-norm and entropy minimization over weak* limits
Martin Dolezal, Jan Hladky
We prove that the accumulation points of a sequence of graphs with respect to the cut-distance are exactly the weak limit points of subsequences of the adj…
On a certain generalization of -spaces
Martin Doležal, Warren B. Moors
We present a simple generalization of -spaces introduced by G. Gruenhage. We show that this generalization leads to a strictly larger class of topological spaces which we call $…
Matching polytons
Martin Dolezal, Jan Hladky
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding noti…
Perfect independent sets with respect to infinitely many relations
Martin Doležal, Wiesław Kubiś
We prove a result on perfect cliques with respect to countably many G-delta relations on a complete metric space. As an application, we show that a Polish group contains a free sub…
Haar meager sets revisited
Martin Doležal, Martin Rmoutil, Benjamin Vejnar +1
In the present article we investigate Darji's notion of Haar meager sets from several directions. We consider alternative definitions and show that some of them are equivalent to t…
Cliques in dense inhomogeneous random graphs
Martin Doležal, Jan Hladký, András Máthé
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…