Sands-Sauer-Woodrow Theorem 1: two-coloured digraphs have a monochromatically independent set reached by all outsiders

Initializing...

Sands-Sauer-Woodrow Theorem 1: two-coloured digraphs have a monochromatically independent set reached by all outsiders · Prove2Me