Acyclic sets in k-majority tournaments

zbMATH Open1218.05062MaRDI QIDQ547779FDOQ547779

Authors: Kevin G. Milans, Daniel H. Schreiber, Douglas B. West 

Publication date: 24 June 2011

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

Full work available at URL: https://eudml.org/doc/230353

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Dominating sets in \(k\)-majority tournaments.
• scientific article; zbMATH DE number 1161309
• A recurrence for bounds on dominating sets in \(k\)-majority tournaments
• On high-dimensional acyclic tournaments
• On the acyclic disconnection of multipartite tournaments
• \(k\)-colour partitions of acyclic tournaments
• scientific article; zbMATH DE number 969987
• A classification of tournaments having an acyclic tournament as a minimum feedback arc set
• A conjecture on cycle-pancyclism in tournaments
• Cycles through arcs in multipartite tournaments and a conjecture of Volkmann

zbMATH Keywords

linear ordersk-majority tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)

Cited In (6)

• On high-dimensional acyclic tournaments
• A recurrence for bounds on dominating sets in \(k\)-majority tournaments
• \(k\)-colour partitions of acyclic tournaments
• Realizing small tournaments through few permutations
• Dominating sets in \(k\)-majority tournaments.
• Elementary proof of a counting formula for acyclic bipartite tournaments

This page was built for publication: Acyclic sets in \(k\)-majority tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547779)