A proof of the Erd\H{o}s-Sands-Sauer-Woodrow conjecture

TL;DR

This paper provides a short proof of the Erd ext{"o}s-Sands-Sauer-Woodrow conjecture, relating edge colorings in tournaments to monochromatic paths, and extends the conjecture's validity to directed graphs with bounded stability number.

Contribution

The paper offers a concise proof of the Erd ext{"o}s-Sands-Sauer-Woodrow conjecture and extends its applicability to certain directed graphs, advancing understanding in graph theory.

Findings

Proof of the Erd ext{"o}s-Sands-Sauer-Woodrow conjecture

Extension of the conjecture to directed graphs with bounded stability number

Implication for the stable marriage theorem

Abstract

A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). As shown by Gy\'arf\'as and P\'alv\H{o}lgyi this result would follow from the following conjecture : If a tournament admits a partition of its arc set into $k$ quasi orders, then its domination number is bounded in terms of $k$. This question is in turn implied by the Erd\H{o}s-Sands-Sauer-Woodrow conjecture : If the arcs of a tournament $T$ are colored with $k$ colors, there is a set $X$ of at most $g(k)$ vertices such that for every vertex $v$ of $T$, there is a monochromatic path from $X$ to $v$. We give a short proof of this statement. We moreover show that the general Sands-Sauer-Woodrow conjecture (which as a special case implies the stable marriage theorem) is valid for directed graphs with bounded stability number. This conjecture remains however open.