Abstract
dc:descriptionFor 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.
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
-
- Cao, Weiting
- Contributors dc:contributor
-
- West, Douglas B.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3250217
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86874