A proof of the Erdős–Sands–Sauer–Woodrow conjecture - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Theory, Series B Year : 2019

A proof of the Erdős–Sands–Sauer–Woodrow conjecture

Abstract

A very nice result of Bárány and Lehel asserts that every finite subset X or can be covered by X-boxes (i.e. each box has two antipodal points in X). As shown by Gyárfás and Pálvő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ős–Sands–Sauer–Woodrow conjecture: If the arcs of a tournament T are coloured with k colour's, there is a set X of at most 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.
Fichier principal
Vignette du fichier
monoPath.pdf (188.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02158330 , version 1 (25-07-2017)
hal-02158330 , version 2 (21-11-2019)

Identifiers

Cite

Nicolas Bousquet, William Lochet, Stéphan Thomassé. A proof of the Erdős–Sands–Sauer–Woodrow conjecture. Journal of Combinatorial Theory, Series B, 2019, Elsevier Journal of Combinatorial Theory, Series B, 137, pp.316-319. ⟨10.1016/j.jctb.2018.11.005⟩. ⟨hal-02158330v2⟩
432 View
120 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More