Files in this item

FilesDescriptionFormat

application/pdf

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

Description

Title:Extremal Problems in Combinatorics: Covering and Coloring Problems
Author(s):Axenovich, Maria Alex
Doctoral Committee Chair(s):Furedi, Zoltan
Department / Program:Mathematics
Discipline:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
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.
Issue Date:1999
Type:Text
Language:English
Description:119 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.
URI:http://hdl.handle.net/2142/86981
Other Identifier(s):(MiAaPQ)AAI9952958
Date Available in IDEALS:2015-09-28
Date Deposited:1999


This item appears in the following Collection(s)

Item Statistics