On the orientation of hypergraphs
| dc.contributor.author | Ruiz-Vargas, Andres J. | |
| dc.date.accessioned | 2011-01-13T16:35:32Z | |
| dc.date.available | 2011-01-13T16:35:32Z | |
| dc.date.issued | 2011-01-13T16:35:32Z | |
| dc.date.submitted | 2010-12 | |
| dc.description.abstract | This is an expository thesis. In this thesis we study out-orientations of hypergraphs, where every hyperarc has one tail vertex. We study hypergraphs that admit out-orientations covering supermodular-type connectivity requirements. For this, we follow a paper of Frank. We also study the Steiner rooted orientation problem. Given a hypergraph and a subset of vertices S ⊆ V, the goal is to give necessary and sufficient conditions for an orientation such that the connectivity between a root vertex and each vertex of S is at least k, for a positive integer k. We follow a paper by Kiraly and Lau, where they prove that every 2k-hyperedge connected hypergraph has such an orientation. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/5711 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | hypergraphs | en |
| dc.subject | orientations | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | On the orientation of hypergraphs | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |