UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

On the orientation of hypergraphs

Thumbnail Image

Files

Ruiz-Vargas_Andres.pdf (887 KB)

Date

2011-01-13T16:35:32Z

Authors

Ruiz-Vargas, Andres J.

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

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.

Description

Keywords

hypergraphs, orientations

LC Keywords

Citation

URI

http://hdl.handle.net/10012/5711

Collections

Theses
Combinatorics and Optimization