University of Illinois Urbana-Champaign

Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings

Mubayi, Dhruv

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/86969

Description

Title
Extremal Problems in Graph Theory: Degree Sequences, Distance, Colorings, and Labelings
Author(s)
Mubayi, Dhruv
Issue Date
1998
Doctoral Committee Chair(s)
West, Douglas B.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Mathematics
Language
eng
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).
Graduation Semester
1998
Type of Resource
text
Permalink
http://hdl.handle.net/2142/86969

Owning Collections

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