21 citations · 39 across the 20 of their papers we have counts for
4 papers · 1 filter
Graph Polynomials and Group Coloring of Graphs
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski +2
Let be an Abelian group and let be a simple graph. We say that is -colorable if for some fixed orientation of and every edge labeling , t…
Reflections on the Erd\H {o}s Discrepancy Problem
Bartłomiej Bosek, Jarosław Grytczuk
We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form , with , is called a \emph{ho…
Dilworth's Theorem for Borel Posets
Bartłomiej Bosek, Jarosław Grytczuk, Zbigniew Lonc
A famous theorem of Dilworth asserts that any finite poset of width can be decomposed into chains. We study the following problem: given a Borel poset of finite width $…
Majority choosability of countable graphs
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
In any vertex coloring of a graph some edges have differently colored ends (\emph{good} edges) and some are monochromatic (\emph{bad} edges). In a proper coloring all edges are goo…