Ramsey Theory: Avoiding Trees with Few Colours

dc.contributor.authorLane, Andrew
dc.date.accessioned2022-09-09T21:00:15Z
dc.date.available2022-09-09T21:00:15Z
dc.date.copyright2022en_US
dc.date.issued2022-09-09
dc.description.abstractThis research project concerns an area of mathematics called graph theory. Graph theory studies the structure of networks called graphs. The nodes of a graph are called vertices, and the connections are called edges. Many problems concern graph colouring, where the vertices or edges are each assigned a value. In particular, this project studies a problem in Ramsey theory. Ramsey theory tells us that in any large enough network, there must be structured parts, and we are particularly interested in how large the network must be to contain such structured parts. The function f(n,H,q) is the minimum number of colours needed to colour the edges of the complete graph Kn, which contains all possible edges, so that every copy of the graph H within the complete graph is coloured with at least q colours. The behavior of f(n,H,q) when H is a complete graph or path has been studied by Erdős, Gyárfás, Krueger, and many others. This project focuses on the case in which the graph H is a tree. It investigates numerical bounds on f(n,H,q) for small trees and asymptotic bounds for larger trees, fully characterizing the asymptotic bounds on f(n,H,q) for a particular class of trees.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelUndergraduateen_US
dc.description.sponsorshipValerie Kuehne Undergraduate Research Awards (VKURA)en_US
dc.identifier.urihttp://hdl.handle.net/1828/14240
dc.language.isoenen_US
dc.subjectmathematicsen_US
dc.subjectgraph theoryen_US
dc.subjectRamsey theoryen_US
dc.subjectcombinatoricsen_US
dc.subjectgraph colouringen_US
dc.titleRamsey Theory: Avoiding Trees with Few Coloursen_US
dc.typePosteren_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Lane_Andrew_VKURA_2022.pdf
Size:
286.8 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2 KB
Format:
Item-specific license agreed upon to submission
Description: