36 citations · 119 across the 13 of their papers we have counts for
14 papers
Arithmetic progressions in a random set on a budget
Jan Hladký, Daniel Iľkovič, Jared León +1
A restricted-budget version of the random graph process, introduced by Frieze, Krivelevich, and Michaeli in 2025, studies the construction of structures by an online player who can…
From flip processes to dynamical systems on graphons
Frederik Garbe, Jan Hladký, Matas Šileikis +1
We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathca…
Impact of jet-production data on the next-to-next-to-leading-order determination of HERAPDF2.0 parton distributions
H1, ZEUS Collaborations, : +234
The HERAPDF2.0 ensemble of parton distribution functions (PDFs) was introduced in 2015. The final stage is presented, a next-to-next-to-leading-order (NNLO) analysis of the HERA da…
The tree packing conjecture for trees of almost linear maximum degree
Peter Allen, Julia Böttcher, Dennis Clemens +3
We prove that there is such that for all sufficiently large , if are any trees such that has vertices and maximum degree at most , the…
Limits of Latin squares
Frederik Garbe, Robert Hancock, Jan Hladký +1
We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the…
Two remarks on graph norms
Frederik Garbe, Jan Hladký, Joonkyung Lee
For a graph , its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions in , , denoted by . One may then…