23 citations · 60 across the 19 of their papers we have counts for
5 papers · 1 filter
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
Jan Grebík, Václav Rozhoň
We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurabl…
Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Jan Grebík, Václav Rozhoň
We present an intimate connection among the following fields: (a) distributed local algorithms: coming from the area of computer science, (b) finitary factors of iid processes: com…
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…
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 $…
A local approach to the Erdős-Sós conjecture
Václav Rozhoň
A famous conjecture of Erdős and Sós states that every graph with average degree more than contains all trees with edges as subgraphs. We prove that the Erdős-Sós conje…