Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings
Author(s):Mubayi, Dhruv
Doctoral Committee Chair(s):West, Douglas B.
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:Let 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).
Issue Date:1998
Type:Text
Language:English
Description:125 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.
URI:http://hdl.handle.net/2142/86969
Other Identifier(s):(MiAaPQ)AAI9912323
Date Available in IDEALS:2015-09-28
Date Deposited:1998


This item appears in the following Collection(s)

Item Statistics