Now showing items 1-2 of 2

  • Generalizing Fröberg's Theorem on Ideals with Linear Resolutions 

    Connon, Emma (2013-11-07)
    In 1990, Fröberg presented a combinatorial classification of the quadratic square-free monomial ideals with linear resolutions. He showed that the edge ideal of a graph has a linear resolution if and only if the complement ...
  • Network Reliability, Simplicial Complexes, and Polynomial Roots 

    DeGagne, Corey (2020-04-02)
    Assume that the vertices of a graph G are always operational, but the edges of G fail independently with probability q ∈ [0, 1]. The all-terminal reliability of G is the probability that the resulting subgraph is connected. ...