Modified Ramsey Numbers

Title

Modified Ramsey Numbers

Authors

Files

Description

This presentation is a project for the course MTH 466: Graph Theory and Combinatorics. A graph is a mathematical objects that consists of two sets: A set of vertices and a set of edges. An edge joins two vertices and depicts a relationship between those vertices. This project will explore a modified Ramsey number, the rainbow Ramsey number RR(F) of a graph F, which is defined as the smallest positive integer n such that if each edge of a complete graph--a graph containing all possible edges between its vertices--is colored from any number of colors, then either an F with edges of only one color (monochromatic) or an F with edges with no repeated colors (rainbow) is produced.

Publication Date

4-24-2019

Project Designation

Course Project

Primary Advisor

Aparna W Higgins

Primary Advisor's Department

Mathematics

Keywords

Stander Symposium poster

Comments

Presenter: Jack W Mccarthy

Modified Ramsey Numbers

Share

COinS