Back to results
University of Illinois at Urbana-Champaign
Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings
Abstract
dc:descriptionLet f(n, p, q) be the minimum number of colors required to color the edges of Kn in such a way that the edges of every Kp⊆Kn together receive at least q colors. We focus on determining f(n, 4, 3) and prove a constructive upper bound of eOlogn . This improves on the previous best (probabilistic) bound of On (due to Erdos and Gyarfas).
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
-
- Mubayi, Dhruv
- Contributors dc:contributor
-
- West, Douglas B.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9912323
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86969