Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:Extremal Problems on Linkage and Packing in Graphs
Author(s):Yu, Gexin
Doctoral Committee Chair(s):Kostochka, Alexandr
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:We study the threshold on theta(G) to ensure that G is H -packable, where H = {K1, C3, K4 - e, C5 + e}, that is, G packs with each graph with |V(G)| vertices whose components lie in H .
Issue Date:2006
Type:Text
Language:English
Description:136 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.
URI:http://hdl.handle.net/2142/86873
Other Identifier(s):(MiAaPQ)AAI3243039
Date Available in IDEALS:2015-09-28
Date Deposited:2006


This item appears in the following Collection(s)

Item Statistics