Abstract
dc:description.abstractWe examine colorings of weighted graphs. Firstly, we examine the weighted analogue of Stanley’s chromatic symmetric function, and prove that the weighted analogue of Crew’s conjecture is not true. Secondly, we generalize the chromatic symmetric function to the chromatic MacMahon function, and use that to prove the MacMahon analogue of Crew’s conjecture.
Degree
thesis:*- Grantor dc:publisher
- University of Kansas
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Trist, May Bee
- Advisor dc:contributor.advisor
-
- Martin, Jeremy L.
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- This item is protected by copyright and unless otherwise specified the copyright of this thesis/dissertation is held by the author.
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
- https://www.proquest.com/LegacyDocView/DISSNUM/32042898
- OAI identifier oai:identifier
- oai:kuscholarworks.ku.edu:1808/38065