Back to search

Rochester Institute of Technology

Minimum saturated subgraphs of tripartite graphs

Abstract

dc:description.abstract

Let F and H be graphs. A subgraph G of H is an F-saturated subgraph of H if F is not a subgraph of G and F is a subgraph of G+e for any edge e in E(H) E(G). The saturation number of F in H is the minimum number of edges in a F-saturated subgraph of H. We denote the saturation number of F in H as sat(H,F). In this thesis we review the history of saturated subgraphs, and prove new results on saturated subgraphs of tripartite graphs. Let Ka,b,c be a compete tripartite graph, with partite sets of size a, b, and c. Specifically, we determine sat(Kn1,n2,n3,Kl,l,l), for n1≥ n2≥ n3, when n2 bounded by a linear function of n3. We also examine the special case when l=1 and determine sat(Kn1,n2,n3,K3)$ for n1≥ n2≥ n3, and n_3 sufficiently large. We also consider two natural variants of saturated subgraphs that arise in the tripartite setting. We examine the behavior of these extensions using illustrative examples to highlight the differences between these variations and the original problem.

Degree

thesis:*
Name thesis:degree_name
Applied and Computational Mathematics (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Mathematical Sciences (COS)

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sullivan, Eric C
Contributors dc:contributor
  • Paul Wenger

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/7933

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Sullivan, Eric C. Minimum saturated subgraphs of tripartite graphs. Thesis thesis, https://repository.rit.edu/theses/7933