4 papers
Infinitesimal finite forcibility and step kernels
Xichao Shu, Jing Yu, Junchi Zhang
We characterize infinitesimal finite forcibility for bounded symmetric real kernels. We prove that the graph-density gradients at a kernel span a finite-dimensional space if and on…
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…
Multi-cyclic graphs in the random graph process with restricted budget
Daniel IľkoviÄ, Jared León, Xichao Shu
We study a controlled random graph process introduced by Frieze, Krivelevich, and Michaeli. In this model, the edges of a complete graph are randomly ordered and revealed sequentia…
On cospectral graphons
Jan Hladký, Daniel IľkoviÄ, Jared León +1
In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectr…