Multipartite tournaments and the push operation
| dc.contributor.author | Wood, Kathryn L. B. | |
| dc.date.accessioned | 2026-07-07T17:15:47Z | |
| dc.date.available | 2026-07-07T17:15:47Z | |
| dc.date.issued | 1999 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Master of Science M.Sc. | |
| dc.description.abstract | Given a digraph D and X ~ V(D), Dx is the digraph obtained from D by pushing X , that is, reversing the direction of all arcs with exactly one end in X . Recently, the study of this operation has been focussed on problems of characterizing digraphs which can be made to satisfy certain properties using the push operation. Klostermeyer proved that the problems of deciding whether a given digraph can be made acyclic, strong, Hamiltonian, or semi-connected, respectively, using the push operation are NP-complete. In this thesis we characterize, in terms of forb idden structures, the multipartite tournaments that can be ma.de acyclic, ordinary, and unidirectional, respectively, using the push operation. We use our results to give a structural characterization of solvable instances of t he game 'Unbalancing Lights'. Finally, we present several characterizations of nearly-acyclic tournaments and the tournaments that can be made nearly-acyclic using the push operation. Our characterizations imply that the problems of deciding if a given multipartite tournament (respectively, tournament) can be made acyclic (respectively, nearly-acyclic) , ordinary, unidirectional, respectively, are solvable in polynomial time. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.uri | https://hdl.handle.net/1828/24041 | |
| dc.language.iso | en | |
| dc.subject.department | Department of Mathematics and Statistics | |
| dc.title | Multipartite tournaments and the push operation | |
| dc.type | Thesis |