Antiflows, Oriented and Strong Oriented Colorings of Graphs

Abstrakt

We give an upper bound on the number of colors needed for a strong oriented coloring of a planar graph, and hereby we find a small antisymmetric flow for any planar graph. In the proof we use a result from combinatorial number theory---the existence of large Sidon sets.