CHROMATIC POLYNOMIALS OF SOME NON-LINEAR HYPERGRAPHS
- ECSU Author/Contributor (non-ECSU co-authors, if there are any, appear on document)
- Douglas Smith, student (Creator)
- Institution
- Elizabeth City State University (ECSU )
- Web Site: https://www.ecsu.edu/academics/library/index.html
Abstract: In this research, we explore the notion of chromatic polynomial, a function that countsthe number of proper colorings, which are partitions of the vertices of a hypergraphwith some constraint. We introduce the reader to several notions of hypergraphs and classify some acyclic non-linear hypergraphs, which are less studied. Further, using combinatorics and the “deletion-contraction” algorithm we present detailed mathematical proofs along with examples as we derive several chromatic polynomials of both linear and non-linear hypergraphs.
Additional Information
- Publication
- Dissertation
- Language: English
- Date: 2021
- Keywords
- chromatic polynomial, hypergraph, combinatorics, algorithm