An Example of a Fraïssé Class Without a Katětov Functor. - Jan Grebík (Appl. Categorical Struct., 2018)

Free sequences in ℘(ω) / fin. - David Chodounský; Vera Fischer; Jan Grebík (Arch. Math. Log., 2019)

Bases and Borel Selectors for Tall families. - Jan Grebík; Carlos Uzcátegui (J. Symb. Log., 2019)

Of Toasts and Tails. - Jan Grebík; Václav Rozhon (CoRR, 2021)

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics. - Jan Grebík; Václav Rozhon (CoRR, 2021)

On Homomorphism Graphs. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2021)

Relating the cut distance and the weak* topology for graphons. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory B, 2021)

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (ITCS, 2022)

Fractional Isomorphism of Graphons. - Jan Grebík; Israel Rocha (Comb., 2022)

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2022)

Cut distance identifying graphon parameters over weak* limits. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory A, 2022)

Local version of Vizing's theorem for multigraphs. - Clinton T. Conley; Jan Grebík; Oleg Pikhurko (J. Graph Theory, 2024)

From descriptive to distributed. - Jan Grebík; Zoltán Vidnyánszky (CoRR, 2025)