3 papers
math.CO2024
Forcing quasirandomness with 4-point permutations
Daniel Kráľ, Jae-baek Lee, Jonathan A. Noel
A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation…
math.CO2022
Quasirandom forcing orientations of cycles
Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak +1
An oriented graph is quasirandom-forcing if the limit (homomorphism) density of in a sequence of tournaments is if and only if the sequence is quasirandom. We…
math.CO2021
Strong modeling limits of graphs with bounded tree-width
Andrzej Grzesik, Daniel Kráľ, Samuel Mohr
The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nešetřil and Ossona de Mendez [J. Symbolic Logic 84 (2019), 452-472]…