A proof of the Erdös-Sands-Sauer-Woodrow conjecture

DOI10.1016/j.jctb.2018.11.005zbMath1415.05061arXiv1703.08123OpenAlexW2737383699MaRDI QIDQ2312612

Nicolas Bousquet, William Lochet, Steéphan Thomassé

Publication date: 17 July 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.08123

zbMATH Keywords

tournamentsdominationtransitive digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. ⋮ Domination and fractional domination in digraphs ⋮ Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Domination in transitive colorings of tournaments
• Monochromatic sinks in nearly transitive arc-colored tournaments
• Covering with Euclidean boxes
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Probabilities within optimal strategies for tournament games
• On a lemma of Scarf.
• Domination and fractional domination in digraphs
• Kernels in weighted digraphs
• Dominating sets in \(k\)-majority tournaments.
• Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
• A Fixed-Point Approach to Stable Matchings and Some Applications
• On weighted kernels of two posets.

This page was built for publication: A proof of the Erdös-Sands-Sauer-Woodrow conjecture