J. Przybylo

collaborators

3 papers

math.CO2025

Mrs. Correct and Majority Colorings

Marcin Anholcer, BartÅomiej Bosek, JarosÅaw Grytczuk +3

A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…

math.CO2024

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs

Mateusz Kamyczura, Jakub PrzybyÅo

Let $G$ be a graph of maximum degree $I^$ which does not contain isolated vertices. An edge coloring $c$ of $G$ is called conflict-free if each edge's closed neighborhood includes…

math.CO2024

The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel

Jakub PrzybyÅo

The irregularity strength of a graph $G$ , $s (G)$ , is the least $k$ such that there exists a ${1, 2, \dots, k}$ -weighting of the edges of $G$ attributing distinct weighted degrees t…