Proper Rainbow Saturation in Graphs
| dc.contributor.author | Lane, Andrew | |
| dc.date.accessioned | 2024-03-17T04:01:33Z | |
| dc.date.available | 2024-03-17T04:01:33Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | This project explores graph theory, which is the study of networks (called “graphs”) with nodes called “vertices” and “edges” between pairs of vertices. A proper edge-colouring of a graph is an assignment of values to each edge of a graph such that edges that share a vertex receive different colours. This project specifically investigates the proper rainbow saturation problem, which is defined as follows: for a larger graph G and a smaller graph H, we say that G is properly rainbow H-saturated if G can be properly edge-coloured with no copy of H that has all different colours, but if any edge is added to G, then G always contains a copy of H with all different colours in any proper colouring. We seek to determine the proper rainbow saturation number, which is the minimum number of edges for G given a fixed graph H and a number of vertices for G. We improve on others’ results by finding exact values for the proper rainbow saturation number for specific graphs and proving general bounds for classes of graphs. This connects proper rainbow saturation to related graph saturation problems and reveals general patterns in the behaviour of these networks. | |
| dc.description.reviewstatus | Reviewed | |
| dc.description.scholarlevel | Undergraduate | |
| dc.description.sponsorship | Jamie Cassels Undergraduate Research Awards (JCURA) | |
| dc.identifier.uri | https://hdl.handle.net/1828/16202 | |
| dc.language.iso | en | |
| dc.publisher | University of Victoria | |
| dc.subject | mathematics | |
| dc.subject | graph theory | |
| dc.subject | combinatorics | |
| dc.subject | discrete mathematics | |
| dc.subject | saturation | |
| dc.subject | edge-colouring | |
| dc.title | Proper Rainbow Saturation in Graphs | |
| dc.type | Poster |