Back to search

University of Victoria (Canada)

Asymptotic existence results on specific graph decompositions

Abstract

dc:description.abstract

This work examines various asymptotic edge-decomposition problems on graphs. A G-group divisible design (G-GDD) of type [g_1, ..., g_u] and index lambda is a decomposition of the edges of the complete lambda-fold multipartite graph H, with groups (maximal independent sets) G_1, ..., G_n, |G_i| = g_i, into graphs (blocks) isomorphic to G. We shall also examine special types of G-GDDs (such as G-frames) and prove that, given all parameters except u, these structures exist for all asymptotically large u satisfying the necessary conditions. Our primary technique is to invoke a useful theorem of Lamken and Wilson on edge-colored graph decompositions. The basic construction for k-RGDDs shall be outlined at the end of the thesis.

Degree

thesis:*
Level thesis:degree_level
Master of Science M.Sc.
Department thesis:degree_department
Department of Mathematics and Statistics
Year dc:date.issued
2010

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chan, Justin
Advisor dc:contributor.supervisor
  • Dukes, Peter

Subjects

dc:subject × 11

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/2909

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chan, Justin. Asymptotic existence results on specific graph decompositions. Master of Science M.Sc. thesis, 2010. http://hdl.handle.net/1828/2909