A recurrence for bounds on dominating sets in \(k\)-majority tournaments

zbMath1234.05110MaRDI QIDQ640421

Dror Fidler

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p166.html

zbMATH Keywords

dominating setmajority tournament

Mathematics Subject Classification ID

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

Related Items (1)

\(k\)-majority digraphs and the hardness of voting with a constant number of voters

This page was built for publication: A recurrence for bounds on dominating sets in \(k\)-majority tournaments