Acyclic sets in \(k\)-majority tournaments

zbMATH Open1218.05062MaRDI QIDQ547779

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.)

zbMATH Keywords

linear ordersk-majority tournament

Mathematics Subject Classification ID

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

Related Items (3)

On high-dimensional acyclic tournaments ⋮ Elementary proof of a counting formula for acyclic bipartite tournaments ⋮ \(k\)-colour partitions of acyclic tournaments

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On high-dimensional acyclic tournaments 👍 👎
• On the acyclic disconnection of multipartite tournaments 👍 👎
• Cycles through arcs in multipartite tournaments and a conjecture of Volkmann 👍 👎
• A recurrence for bounds on dominating sets in \(k\)-majority tournaments 👍 👎
• A classification of tournaments having an acyclic tournament as a minimum feedback arc set 👍 👎
• \(k\)-colour partitions of acyclic tournaments 👍 👎
• Dominating sets in \(k\)-majority tournaments. 👍 👎
• A conjecture on cycle-pancyclism in 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)