Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex -Diameter -2 -Critical Graphs and Decomposition
Author(s):Chen, Ya-Chen
Doctoral Committee Chair(s):Furedi, Zoltan
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
Abstract:A star, K1,s, is the complete bipartite graph whose partite sets have size 1 and s, respectively. A graph G has the t-star property if every t vertices of G belong to a subgraph which is a star. Erdo&huml;s, Sauer, Schaer, and Spencer [ESSS] defined f(t, k) to be the minimum n such that the complete graph K n can be decomposed into k spanning subgraphs with the t-star property. We prove that ift≥3and k≥68+t,then ft,k ≥32˙2 tk+25-10t ˙2t-2-3. .
Issue Date:2000
Type:Text
Language:English
Description:120 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.
URI:http://hdl.handle.net/2142/86994
Other Identifier(s):(MiAaPQ)AAI9971048
Date Available in IDEALS:2015-09-28
Date Deposited:2000


This item appears in the following Collection(s)

Item Statistics