Colorings and orientations of matrices and graphs.
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Mr. Paint and Mrs. Correct.
A paintability version of the combinatorial Nullstellensatz, and list colorings of -partite -uniform hypergraphs.
Algebraically solvable problems: describing polynomials as equivalent to explicit solutions.
On the dispersions of the polynomial maps over finite fields.
Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game.
Page 1