Date of Award

2024

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Mathematical Sciences

First Advisor

Puck Rombach

Abstract

In this work, the current state of the field of edge-colored graphs is surveyed. Anew concept of unshrinkable edge colorings is introduced which is useful for rainbow subgraph problems and interesting in its own right. This concept is analyzed in some depth. Building upon the linear edge ordering described in a recent work from Gerbner, Methuku, Nagy, Pálvölgyi, Tardos, and Vizer, edge-ordering graphs with the cyclic group is introduced and some results are given on this and a related counting problem.

Language

en

Number of Pages

46 p.

Included in

Mathematics Commons

Share

COinS