5 citations · 5 across the 5 of their papers we have counts for
5 papers
Alon-Tarsi for hypergraphs
Marcin Anholcer, Bartłomiej Bosek, Grzegorz Gutowski +6
Given a hypergraph , define for every edge a linear expression with arguments corresponding to the vertices. Next, let the polynomial be the product of such…
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…
On a Problem of Steinhaus
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +4
Let be a positive integer. A sequence of points in the unit interval is piercing if $\{x_1,x_2,\ldots,x_n\}\cap \left[\frac{i}{n},\frac{i+1}{n}…
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…
Graph polynomials and paintability of plane graphs
Jarosław Grytczuk, Stanislav Jendrol', Mariusz Zając
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a pl…