Sebastian Czerwi'nski

collaborators

3 papers

math.CO2023

Cooperative coloring of matroids

Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1

Let $M_{1}, M_{2}, \dots, M_{k}$ be a collection of matroids on the same ground set $E$ . A coloring $c : E \to {1, 2, \dots, k}$ is called \emph{cooperative} if for every color $j$ ,…

math.CO2023

Strong arboricity of graphs

Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1

An edge coloring of a graph $G$ is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph $G$ , denoted by $\arb (G)$, is the least number of colors needed for…

math.CO2023

On harmonious coloring of hypergraphs

Sebastian Czerwiński

A harmonious coloring of a $k$ -uniform hypergraph $H$ is a vertex coloring such that no two vertices in the same edge have the same color, and each $k$ -element subset of colors app…