Presentation av examensarbete C i matematik: Recent development in the cutting model

  • Datum: –12.15
  • Plats: Ångströmlaboratoriet 64119
  • Föreläsare: Alfred Lindström
  • Arrangör: Matematiska institutionen
  • Kontaktperson: Xing Shi Cai
  • Seminarium

A study of the destruction of different graphs using k-cut theory. We define k-cuts for arbitrary k using the standard algorithmic approach in addition to the equivalent method, when cutting trees, of using records. By looking at paths and complete graphs, we find a lower and upper bound respectively for the distributions of the k-cut number. From this, we study different given graphs structures such as trees. If time is available, we hope to run a few simulations on Erdős–Rényi random graphs; a graph structure where little to no research has been done regarding k-cuts