Acyclic sets in k-majority tournaments
From MaRDI portal
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
Cited in
(7)- Elementary proof of a counting formula for acyclic bipartite tournaments
- On high-dimensional acyclic tournaments
- \(k\)-colour partitions of acyclic tournaments
- Dominating sets in \(k\)-majority tournaments.
- Realizing small tournaments through few permutations
- A recurrence for bounds on dominating sets in \(k\)-majority tournaments
- Approval gap of weighted \(k\)-majority 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)