Back to results
University of Illinois at Urbana-Champaign
Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex -Diameter -2 -Critical Graphs and Decomposition
Abstract
dc:descriptionA 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. .
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chen, Ya-Chen
- Contributors dc:contributor
-
- Furedi, Zoltan
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9971048
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86994