Mathematics Commons^™

Graph-Theoretic Simplicial Complexes, Hajos-Type Constructions, And K-Matchings, Julianne Vega

Theses and Dissertations--Mathematics

A graph property is monotone if it is closed under the removal of edges and vertices. Given a graph G and a monotone graph property P, one can associate to the pair (G,P) a simplicial complex, which serves as a way to encode graph properties within faces of a topological space. We study these graph-theoretic simplicial complexes using combinatorial and topological approaches as a way to inform our understanding of the graphs and their properties.

In this dissertation, we study two families of simplicial complexes: (1) neighborhood complexes and (2) k-matching complexes. A neighborhood complex is a simplicial …

Applications Of Geometric And Spectral Methods In Graph Theory, Lauren Morey Nelsen

Electronic Theses and Dissertations

Networks, or graphs, are useful for studying many things in today’s world. Graphs can be used to represent connections on social media, transportation networks, or even the internet. Because of this, it’s helpful to study graphs and learn what we can say about the structure of a given graph or what properties it might have. This dissertation focuses on the use of the probabilistic method and spectral graph theory to understand the geometric structure of graphs and find structures in graphs. We will also discuss graph curvature and how curvature lower bounds can be used to give us information about …

Persistence Equivalence Of Discrete Morse Functions On Trees, Yuqing Liu

Mathematics Summer Fellows

We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this notion of equivalence to other notions of equivalent discrete Morse functions. We then compute an upper bound for the number of persistence equivalent discrete Morse functions on a fixed graph and show that this upper bound is sharp in the case where our graph is a tree. We conclude with an example illustrating our construction.

Intrinsic Linking And Knotting Of Graphs In Arbitrary 3–Manifolds, Erica Flapan, Hugh Howards, Don Lawrence, Blake Mellor

Pomona Faculty Publications and Research

We prove that a graph is intrinsically linked in an arbitrary 3–manifold M if and only if it is intrinsically linked in S³. Also, assuming the Poincaré Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S³.