Magdalena Prorok

activity

20232026

collaborators

3 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.CO2024

Directed graphs without rainbow stars

Daniel Gerbner, Andrzej Grzesik, Cory Palmer +1

In a rainbow version of the classical Turán problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determin…

math.CO2023

Majority distinguishing edge coloring

Aleksandra Gorzkowska, Magdalena Prorok

We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is…