P. Mazur

collaborators

3 papers

math.CO2019

Hat chromatic number of graphs

Bartłomiej Bosek, Andrzej Dudek, Michał Farnik +2

We study the hat chromatic number of a graph defined in the following way: there is one player at each vertex of a loopless graph $G$ , an adversary places a hat of one of $K$ color…

math.CO2015

A structure theorem for sets of small popular doubling, revisited

Przemysław Mazur

We prove that every set $A \subset Z / p Z$ with $E_{x} min (1_{A} * 1_{A} (x), t) \leq (2 + δ) t E_{x} 1_{A} (a)$ is very close to an arithmetic progression. Here $p$ stan…

math.CO2015

A structure theorem for sets of small popular doubling

Przemysław Mazur

In this paper we prove that every set $A \subset Z$ satisfying the inequality $\sum_{x} min (1_{A} * 1_{A} (x), t) \leq (2 + δ) t ∣ A ∣$ for $t$ and $δ$ in suitable ranges, then $A$ must be v…