Sylwia Antoniuk

activity

20232026

collaborators

6 papers

math.CO2026

Rainbow Turán numbers for paths of length four

Sylwia Antoniuk, Andrzej Grzesik, Magdalena Prorok +1

Given a set $V$ of $n$ vertices and an integer $k \geq 1$ , our goal is to maximize the number of edges in graphs $G_{1}, G_{2}, \dots, G_{k}$ , defined on $V$ , under the constraint that the…

math.CO2026

Strong Majority Edge-Coloring

Sylwia Antoniuk, Magdalena Prorok, Nika Salia

A strong majority edge-coloring of a graph is an edge-coloring in which, for every edge $e$ and every color $i$ , at most half of the edges adjacent to $e$ have color $i$ . Such a co…

math.CO2026

The complete picture for clique factors in randomly perturbed graphs

Sylwia Antoniuk, Nina Kamčev, Christian Reiher +1

A randomly perturbed graph $G^{p} = G_{α} \cup G_{n, p}$ is obtained by taking a deterministic $n$ -vertex graph $G_{α} = (V, E)$ with minimum degree $δ (G) \geq α n$ and adding the edges of th…

math.CO2026

On constructing small subgraphs in the budget-constrained random graph process

Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova +1

Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process…

math.CO2024

Creating spanning trees in Waiter-Client games

Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3

For a positive integer $n$ and a tree $T_{n}$ on $n$ vertices, we consider an unbiased Waiter-Client game $WC (n, T_{n})$ played on the complete graph~ $K_{n}$ , in which Waiter's g…

math.CO2023

Tree universality in positional games

Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3

In this paper we consider positional games where the winning sets are tree universal graphs. Specifically, we show that in the unbiased Maker-Breaker game on the complete graph $K_…