Back to results
University of Illinois at Urbana-Champaign
Extremal Problems in Combinatorics: Covering and Coloring Problems
Abstract
dc:descriptionThe 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.
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
-
- Axenovich, Maria Alex
- Contributors dc:contributor
-
- Furedi, Zoltan
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9952958
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86981