42 citations · 109 across the 37 of their papers we have counts for
4 papers · 1 filter
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…
Extensions and reductions of square-free words
Michał Dębski, Jarosław Grytczuk, Bartłomiej Pawlik
A word is square-free if it does not contain a nonempty word of the form as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words…
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…