Homomorphism densities of graphs in kernels

Simple item page
dc.contributor.authorTurton, Chris
dc.date.accessioned2025-04-24T15:58:41Z
dc.date.available2025-04-24T15:58:41Z
dc.date.issued2025
dc.description.abstractThis project explores the branch of Mathematics known as graph theory, where a graph is a set of vertices paired with a set of edges. We define an abstraction of a graph known as a kernel, and we explore various problems about the homomorphism density of a graph in a kernel. In particular, we generalize previous results about decomposing sums of densities of odd cycles in terms of the simpler densities of paths. In addition, we investigate lower bounds for inequalities involving certain density sums. We provide several explicit kernel constructions which certify that some of these bounds are sharp.
dc.description.reviewstatusReviewed
dc.description.scholarlevelUndergraduate
dc.description.sponsorshipJamie Cassels Undergraduate Research Awards (JCURA)
dc.identifier.urihttps://hdl.handle.net/1828/21989
dc.language.isoen
dc.publisherUniversity Of Victoria
dc.subjectmathematics
dc.subjectgraph
dc.subjectgraph theory
dc.subjectkernel
dc.subjectgraphon
dc.subjecthomomorphism density
dc.titleHomomorphism densities of graphs in kernels
dc.typePoster

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
turton_chris_jcura_poster_2025.pdf
Size:
491.94 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Jamie Cassels Undergraduate Research Awards (JCURA)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.