Daniel Il'kovič

activity

20222026

collaborators

6 papers

math.PR2026

Extremal persistence probabilities of exchangeable sign-invariant random variables

Daniel Iľkovič, Jun Yan

Let $(X_{1}, \dots, X_{n})$ be a random variable in $(R ∖ {0})^{n}$ that is both exchangeable and sign-invariant. For every $k \in [n]$ , let $S_{k} = \sum_{i = 1}^{k} X_{i}$ . Define t…

math.CO2026

$L_{2}$ Turán Problems for Small Tournaments and Stability

Daniel Iľkovič

We investigate the $L_{2}$ Turán problems for various small directed graphs, specifically focusing on self-converse tournaments and stability versions. First, we determine the exact…

math.CO2026

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…

math.CO2024

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…

math.CO2024

Hypergraphs with uniform Turán density equal to 8/27

Frederik Garbe, Daniel Iľkovič, Daniel Kráľ +2

In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph $H$ is the inf…

math.CO2022

Quasirandom forcing orientations of cycles

Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak +1

An oriented graph $H$ is quasirandom-forcing if the limit (homomorphism) density of $H$ in a sequence of tournaments is $2^{- ∥ H ∥}$ if and only if the sequence is quasirandom. We…