12 citations · 14 across the 5 of their papers we have counts for
5 papers
New bounds on the maximum number of neighborly boxes in R^d
Noga Alon, Jarosław Grytczuk, Andrzej P. Kisielewicz +1
A family of axis-aligned boxes in $\er^d$ is \emph{-neighborly} if the intersection of every two of them has dimension at least and at most . Let denote the…
Ordered unavoidable sub-structures in matchings and random matchings
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
An ordered matching of size is a graph on a linearly ordered vertex set , , consisting of pairwise disjoint edges. There are three different ordered matchings of…
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…
Online version of the theorem of Thue
Jarosław Grytczuk, Piotr Szafruga, Michał Zmarz
A sequence S is nonrepetitive if no two adjacent blocks of S are the same. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3 symbols. We consider…
Additive colorings of planar graphs
Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński +3
An \emph{additive coloring} of a graph is an assignment of positive integers to the vertices of such that for every two adjacent vertices the sums of number…