Line graphs of simplicial complexes
Abstract
We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the combinatorial structure of its line graph. We characterize those pure simplicial complexes whose line graph is a complete (bipartite) graph. We give conditions that line graphs of simplicial complexes should fulfill.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.