University of Illinois Urbana-Champaign

Extremal Problems in Combinatorics: Covering and Coloring Problems

Axenovich, Maria Alex

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

Description

Title
Extremal Problems in Combinatorics: Covering and Coloring Problems
Author(s)
Axenovich, Maria Alex
Issue Date
1999
Doctoral Committee Chair(s)
Furedi, Zoltan
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
The Ramsey-type coloring problems we consider include generalized Ramsey and generalized Anti-Ramsey problems. Namely, what is the minimal (or maximal) number of colors on the edges of a graph such that every subgraph isomorphic to some fixed graph uses at most q2 and at least q1 colors on its edges. Thus we generalize the results of Erdős, Gyarfas, Simonovits and Sos and solve some of their old open problems.
Graduation Semester
1999
Type of Resource
text
Permalink
http://hdl.handle.net/2142/86981

Owning Collections

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