42 citations · 109 across the 37 of their papers we have counts for
6 papers · 1 filter
Twins in ordered hyper-matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
An ordered -matching of size is an -uniform hypergraph on a linearly ordered set of vertices, consisting of pairwise disjoint edges. Two ordered -matchings are iso…
Variations on shuffle squares
Jarosław Grytczuk, Bartłomiej Pawlik, Mariusz Pleszczyński
We study decompositions of words into subwords that are in some sense similar, which means that one subword may be obtained from the other by a relatively simple transformation. Ou…
Cooperative coloring of matroids
Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1
Let be a collection of matroids on the same ground set . A coloring is called \emph{cooperative} if for every color ,…
Strong arboricity of graphs
Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1
An edge coloring of a graph is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph , denoted by $\arb (G)$, is the least number of colors needed for…
Strongly proper connected coloring of graphs
Michał Dębski, Jarosław Grytczuk, Paweł Naroski +1
We study a new variant of \emph{connected coloring} of graphs based on the concept of \emph{strong} edge coloring (every color class forms an \emph{induced} matching). In particula…
Erdős-Szekeres type Theorems for ordered uniform matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
For , an ordered -uniform matching of size is an -uniform hypergraph on a linearly ordered vertex set , with , consisting of pairwise disjoint edg…