Graph-Theoretic Simplicial Complexes, Hajos-type Constructions, and k-Matchings

Julianne Vega
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....
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.