Publication:

Social Networks: Enumerating Maximal Community Patterns in c-Closed Graphs

Loading...
Thumbnail Image

Files

BOURLA-GABRIELA-THESIS.pdf (1.6 MB)

Date

2023-07-10

Journal Title

Journal ISSN

Volume Title

Publisher

Research Projects

Organizational Units

Journal Issue

Access Restrictions

Abstract

This thesis continues the study of social networks through the model of c-closed graphs presented by Fox et al. Previous literature counts maximal structures in c-closed graphs such as maximal cliques and maximal complete bipartite graphs. We continue this work by enumerating maximal blow-ups of a graph H of a given family in a host c-closed graph G. Our main results find that for a finite family of induced graphs, while there is not always a polynomial bound, we are able to provide a characterization that gives a polynomial bound. For any finite family of non-induced graphs, we find that there is always a polynomial bound.

Description

Type of resource

Princeton University Senior Theses

Keywords

Location

Citation