Domination in tournaments

DOI10.1016/j.jctb.2017.10.001zbMath1384.05090OpenAlexW2766396921MaRDI QIDQ1745734

Ringi Kim, Maria Chudnovsky, Chun-Hung Liu, P. D. Seymour, Steéphan Thomassé

Publication date: 18 April 2018

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2017.10.001

zbMATH Keywords

VC-dimensiontournamentdomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Domination and fractional domination in digraphs ⋮ On the kernel and related problems in interval digraphs ⋮ Coloring dense digraphs ⋮ Domination in Digraphs ⋮ Coloring tournaments: from local to global

Cites Work

• Domination in transitive colorings of tournaments
• \(\epsilon\)-nets and simplex range queries
• On finding a minimum dominating set in a tournament
• On monochromatic paths in edge-coloured digraphs
• Bounding the vertex cover number of a hypergraph
• Probabilities within optimal strategies for tournament games
• Tournaments and colouring
• Dominating sets in \(k\)-majority tournaments.
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• The Voting Problem
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Domination in tournaments