Home WakeSpace Scholarship › Electronic Theses and Dissertations

E-Positivitity Conjecture and Line Graphs

Electronic Theses and Dissertations

Item Files

Item Details

abstract
Motivated by Richard Stanley's e-positivity conjecture, we explore the relationships between line graphs, modified line graphs, and incomparability graphs. We show that line graphs and modified line graphs will fail to contain the set of all incomparability graphs of (3+1)-free posets. In an effort to start finding a list of forbidden graphs for incomparability graphs, we test all simple, connected graphs with 6 or fewer vertices.
subject
e-positivity
forbidden
graph
incomparability
line
contributor
Nichols, David E (author)
Mason, Sarah Y (committee chair)
Allen, Edward E (committee member)
Howards, Hugh N (committee member)
date
2020-05-29T08:36:05Z (accessioned)
2020-05-29T08:36:05Z (available)
2020 (issued)
degree
Mathematics and Statistics (discipline)
identifier
http://hdl.handle.net/10339/96839 (uri)
language
en (iso)
publisher
Wake Forest University
title
E-Positivitity Conjecture and Line Graphs
type
Thesis

Usage Statistics