Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3250217.pdf (3MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Some Problems in Structural Graph Theory
Author(s):Cao, Weiting
Doctoral Committee Chair(s):West, Douglas B.
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:For a complete bipartite graph Ks,t, the total number of edges st may not be a triangular number; that is, there may exist 0 < ℓ ≤ n such that e(G) = 1 + 2 + 3 + ··· + n + ℓ. A new question is, can we still decompose the graph Ks,t into distinct paths of lengths 1, 2, 3,..., n, ℓ, one for each, if the necessary condition n ≤ 2t is satisfied? We give a positive answer.
Issue Date:2006
Type:Text
Language:English
Description:108 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.
URI:http://hdl.handle.net/2142/86874
Other Identifier(s):(MiAaPQ)AAI3250217
Date Available in IDEALS:2015-09-28
Date Deposited:2006


This item appears in the following Collection(s)

Item Statistics