University of Illinois Urbana-Champaign

Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex -Diameter -2 -Critical Graphs and Decomposition

Chen, Ya-Chen

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/86994

Description

Title
Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex -Diameter -2 -Critical Graphs and Decomposition
Author(s)
Chen, Ya-Chen
Issue Date
2000
Doctoral Committee Chair(s)
Furedi, Zoltan
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
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. .
Graduation Semester
2000
Type of Resource
text
Permalink
http://hdl.handle.net/2142/86994

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Mathematics