Learn More
Let G be a simple (i.e., no loops and no multiple edges) graph. We investigate the question of how to modify G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on modifications given by adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex in G. We(More)
I hereby declare that the materials and results in this thesis, unless accompanied by specific references, are original and have not been published elsewhere. Abstract This thesis attempts to investigate various embeddings of rational surfaces. Most of the attention is paid to those of the blowup of P 2 at a set of points. In Chapter 1, the notions of a(More)
  • 1